Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
From MaRDI portal
Publication:1016107
DOI10.1007/S10107-007-0180-YzbMath1176.90579OpenAlexW2124643039MaRDI QIDQ1016107
Publication date: 4 May 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0180-y
global convergencesequential quadratic programmingSlater conditionlinesearchnonsmooth penalty function
Related Items (22)
A globally convergent penalty-free method for optimization with equality constraints and simple bounds ⋮ A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization ⋮ An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming ⋮ Global Dynamical Solvers for Nonlinear Programming Problems ⋮ Feedback stabilization methods for the solution of nonlinear programming problems ⋮ The multiproximal linearization method for convex composite problems ⋮ A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization ⋮ Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints ⋮ An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming ⋮ A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences ⋮ A new norm-relaxed SQP algorithm with global convergence ⋮ Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs ⋮ Some new facts about sequential quadratic programming methods employing second derivatives ⋮ An ADMM-based SQP method for separably smooth nonconvex optimization ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints ⋮ Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems ⋮ Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity ⋮ A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
Uses Software
Cites Work
- A globally convergent method for nonlinear programming
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
- A quadratically-convergent algorithm for general nonlinear programming problems
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
