9,622 research outputs found
A recursively feasible and convergent Sequential Convex Programming procedure to solve non-convex problems with linear equality constraints
A computationally efficient method to solve non-convex programming problems
with linear equality constraints is presented. The proposed method is based on
a recursively feasible and descending sequential convex programming procedure
proven to converge to a locally optimal solution. Assuming that the first
convex problem in the sequence is feasible, these properties are obtained by
convexifying the non-convex cost and inequality constraints with inner-convex
approximations. Additionally, a computationally efficient method is introduced
to obtain inner-convex approximations based on Taylor series expansions. These
Taylor-based inner-convex approximations provide the overall algorithm with a
quadratic rate of convergence. The proposed method is capable of solving
problems of practical interest in real-time. This is illustrated with a
numerical simulation of an aerial vehicle trajectory optimization problem on
commercial-of-the-shelf embedded computers
Local convergence of the Levenberg-Marquardt method under H\"{o}lder metric subregularity
We describe and analyse Levenberg-Marquardt methods for solving systems of
nonlinear equations. More specifically, we propose an adaptive formula for the
Levenberg-Marquardt parameter and analyse the local convergence of the method
under H\"{o}lder metric subregularity of the function defining the equation and
H\"older continuity of its gradient mapping. Further, we analyse the local
convergence of the method under the additional assumption that the
\L{}ojasiewicz gradient inequality holds. We finally report encouraging
numerical results confirming the theoretical findings for the problem of
computing moiety conserved steady states in biochemical reaction networks. This
problem can be cast as finding a solution of a system of nonlinear equations,
where the associated mapping satisfies the \L{}ojasiewicz gradient inequality
assumption.Comment: 30 pages, 10 figure
Power System State Estimation and Contingency Constrained Optimal Power Flow - A Numerically Robust Implementation
The research conducted in this dissertation is divided into two main parts. The first part provides further improvements in power system state estimation and the second part implements Contingency Constrained Optimal Power Flow (CCOPF) in a stochastic multiple contingency framework. As a real-time application in modern power systems, the existing Newton-QR state estimation algorithms are too slow and too fragile numerically. This dissertation presents a new and more robust method that is based on trust region techniques. A faster method was found among the class of Krylov subspace iterative methods, a robust implementation of the conjugate gradient method, called the LSQR method. Both algorithms have been tested against the widely used Newton-QR state estimator on the standard IEEE test networks. The trust region method-based state estimator was found to be very reliable under severe conditions (bad data, topological and parameter errors). This enhanced reliability justifies the additional time and computational effort required for its execution. The numerical simulations indicate that the iterative Newton-LSQR method is competitive in robustness with classical direct Newton-QR. The gain in computational efficiency has not come at the cost of solution reliability. The second part of the dissertation combines Sequential Quadratic Programming (SQP)-based CCOPF with Monte Carlo importance sampling to estimate the operating cost of multiple contingencies. We also developed an LP-based formulation for the CCOPF that can efficiently calculate Locational Marginal Prices (LMPs) under multiple contingencies. Based on Monte Carlo importance sampling idea, the proposed algorithm can stochastically assess the impact of multiple contingencies on LMP-congestion prices
- …