Sequential quadratic programming methods

PE Gill, E Wong - Mixed integer nonlinear programming, 2011 - Springer
Abstract In his 1963 PhD thesis, Wilson proposed the first sequential quadratic programming
(SQP) method for the solution of constrained nonlinear optimization problems. In the …

A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity …

C He, Z Lu, TK Pong - SIAM Journal on Optimization, 2023 - SIAM
In this paper we consider finding a second-order stationary point (SOSP) of nonconvex
equality constrained optimization when a nearly feasible point is known. In particular, we first …

Lagrangian duality and branch-and-bound algorithms for optimal power flow

DT Phan - Operations Research, 2012 - pubsonline.informs.org
This paper investigates a Lagrangian dual problem for solving the optimal power flow
problem in rectangular form that arises from power system analysis. If strong duality does not …

A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control

Z Sun, Y Tian, H Li, J Wang - Optimal Control Applications and …, 2016 - Wiley Online Library
For periodic gait optimization problem of the bipedal walking robot, a class of global and
feasible sequential quadratic programming algorithm (FSQPA) is proposed based on …

A primal–dual penalty-interior-point method for solving the reactive optimal power flow problem with discrete control variables

JA Delgado, EC Baptista, AR Balbo, EM Soler… - International Journal of …, 2022 - Elsevier
Abstract The Optimal Reactive Power Flow (ORPF) problem has been used as an important
computational tool for power system planning and operation. Its mixed-discrete version …

A two-stage decomposition approach for AC optimal power flow

S Tu, A Wächter, E Wei - IEEE Transactions on Power Systems, 2020 - ieeexplore.ieee.org
The alternating current optimal power flow (AC-OPF) problem is critical to power system
operations and planning, but it is generally hard to solve due to its nonconvex and large …

An interior point method for nonlinear programming with infeasibility detection capabilities

J Nocedal, F Öztoprak, RA Waltz - Optimization Methods and …, 2014 - Taylor & Francis
This paper describes an interior point method for nonlinear programming endowed with
infeasibility detection capabilities. The method is composed of two phases, a main phase …

A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints

XW Liu, YH Dai, YK Huang, J Sun - Mathematics of Computation, 2023 - ams.org
We introduce a twice differentiable augmented Lagrangian for nonlinear optimization with
general inequality constraints and show that a strict local minimizer of the original problem is …

A sequential quadratic optimization algorithm with rapid infeasibility detection

JV Burke, FE Curtis, H Wang - SIAM Journal on Optimization, 2014 - SIAM
We present a sequential quadratic optimization (SQO) algorithm for nonlinear constrained
optimization. The method attains all of the strong global and fast local convergence …

Minimum-time trajectory planning for a differential drive mobile robot considering non-slipping constraints

IF Okuyama, MROA Maximo, RJM Afonso - Journal of Control, Automation …, 2021 - Springer
We propose a real-time minimum-time trajectory planning strategy with obstacle avoidance
for a differential-drive mobile robot in the context of robot soccer. The method considers …