A successive quadratic programming algorithm with global and superlinear convergence properties
The author suggests an algorithm for solving the nonlinear programming problem (NPL): Minimize f(x) subject to \(c_ i(x)\leq 0\) \((i=1,...,m')\), \(c_ i(x)=0\), \((i=m'+1,...,m)\) where the functions f, \(c_ i\) are twice continuously differentiable. In order to ensure a fast ultimate convergence, direction-finding subproblems are derived from the second- order approximation to (NLP) which in itself is not tractable and is modified to a quadratic programming problem. The author claims that this modification has the added advantage of avoiding the Maratos effect, a phenomenon where the use of a nonsmooth exact penalty function results in the deterioration of the desirable local convergence property. Such devices have been incorporated in algorithms for ensuring global and superlinear convergence properties by various authors including \textit{T. F. Coleman} and \textit{A. R. Conn} [Math. Program. 24, 123-136, 137-161 (1982; Zbl 0501.90077, Zbl 0501.90078)] and \textit{R. M. Chamberlin, M. J. D. Powell, C. Lemarechal} and \textit{H. C. Pedersen} [Math. Program. Study 16, 1-17 (1982; Zbl 0501.90078)]. The algorithm suggested for solving (NLP) either terminates at a Kuhn-Tucker point of (NLP) or generates an infinite sequence \(\{\) \(x\}\) whose limit points are Kuhn-Tucker points of (NLP). Under suitable assumptions, it is shown that the sequence \(\{\) \(x\}\) generated by the algorithm converges superlinearly.
- scientific article; zbMATH DE number 4204137
- scientific article; zbMATH DE number 27281
- An interior point algorithm for global optimal solutions and KKT points
- On the Convergence of Constrained Optimization Methods with Accurate Hessian Information on a Subspace
- scientific article; zbMATH DE number 4158404
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- New Results on a Continuously Differentiable Exact Penalty Function
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- scientific article; zbMATH DE number 4009673
- An example of irregular convergence in some constrained optimization methods that use the projected Hessian
- A globally convergent method for nonlinear programming
- A surperlinearly convergent algorithm for constrained optimization problems
- scientific article; zbMATH DE number 3727523 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Nonlinear programming via an exact penalty function: Global analysis
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
- Revisions of constraint approximations in the successive QP method for nonlinear programming problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- A new successive quadratic programming algorithm
- A sequential quadratic programming-based algorithm for the optimization of gas networks
- A recursive quadric programming algorithm that uses new nondifferentiable penalty functions
- An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
- New sequential quadratic programming algorithm with consistent subproblems
- A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence
- Combining trust region and linesearch algorithm for equality constrained optimization
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- An efficient sequential quadratic programming algorithm for nonlinear programming
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
- A successive quadratic programming method that uses new corrections for search directions
- An improved feasible QP-free algorithm for inequality constrained optimization
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- An ADMM-based SQP method for separably smooth nonconvex optimization
- A global QP-free algorithm for mathematical programs with complementarity constraints
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
- A penalty-free method with superlinear convergence for equality constrained optimization
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- A feasible SQP method for nonlinear programming
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- A superlinearly convergent hybrid algorithm for solving nonlinear programming
- scientific article; zbMATH DE number 5831961 (Why is no real title available?)
- A Strategy for Global Convergence in a Sequential Quadratic Programming Algorithm
- A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING
- scientific article; zbMATH DE number 4158404 (Why is no real title available?)
- Generalized monotone line search SQP algorithm for constrained minimax problems
- scientific article; zbMATH DE number 3963585 (Why is no real title available?)
- Combining Trust Region and Line Search Methods for Equality Constrained Optimization
- scientific article; zbMATH DE number 7009452 (Why is no real title available?)
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- On the local convergence of a penalty-function-free SQP method
- Sequential quadratic optimization for nonlinear optimization problems on Riemannian manifolds
- Convergence of the BFGS-SQP Method for Degenerate Problems
- Algorithm for solving NLP problems with the use of a modified Lagrange function
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization
- An overview of nonlinear optimization
- Switching stepsize strategies for sequential quadratic programming
- Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
- A successive linear approximation algorithm for the global minimization of a concave quadratic program
- An efficient feasible SQP algorithm for inequality constrained optimization
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- A quadratically approximate framework for constrained optimization, global and local convergence
This page was built for publication: A successive quadratic programming algorithm with global and superlinear convergence properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731379)