On the Convergence of Successive Linear-Quadratic Programming Algorithms
From MaRDI portal
Publication:5470205
DOI10.1137/S1052623403426532zbMath1092.90061OpenAlexW2122587727MaRDI QIDQ5470205
Byrd, Richard H., Richard A. Waltz, Nocedal, Jorge, Nicholas I. M. Gould
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623403426532
nonlinear optimizationsequential linear programmingglobal convergence theorypenalty parameter updates
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization, A proximal method for composite minimization, On the convergence of an active-set method for ℓ1minimization, A penalty-interior-point algorithm for nonlinear constrained optimization, DrAmpl: A meta solver for optimization problem analysis, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, On the use of piecewise linear models in nonlinear programming, A line search exact penalty method using steering rules, Steering exact penalty methods for nonlinear programming, On the complexity of finding first-order critical points in constrained nonlinear optimization, A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints, Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs, Simple solution methods for separable mixed linear and quadratic knapsack problem, Ambiguity in portfolio selection, Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs, Operations research and optimization (ORO)
