Switching stepsize strategies for sequential quadratic programming
From MaRDI portal
Publication:635801
DOI10.1007/S10957-010-9790-2zbMATH Open1219.90190OpenAlexW1997390521MaRDI QIDQ635801FDOQ635801
Authors: George Tzallas-Regas, Berç Rustem
Publication date: 23 August 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9790-2
Recommendations
nonlinear programmingglobal convergenceSQPmerit functionsstepsize convergenceswitching stepsize strategies
Cites Work
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Numerical Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A globally convergent method for nonlinear programming
- Handbook of applied optimization
- Nonlinear programming without a penalty function.
- Test examples for nonlinear programming codes
- A surperlinearly convergent algorithm for constrained optimization problems
- Title not available (Why is that?)
- Algorithms for nonlinear constraints that use lagrangian functions
- Encyclopedia of optimization. In 6 vols.
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- An Exact Potential Method for Constrained Maxima
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Steering exact penalty methods for nonlinear programming
- Title not available (Why is that?)
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- Title not available (Why is that?)
- Convergent stepsizes for constrained optimization algorithms
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
- Title not available (Why is that?)
- Switching stepsize strategies for sequential quadratic programming
Cited In (5)
- An interior-point algorithm for nonlinear minimax problems
- The Sequential Quadratic Programming Method
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
- An SQP algorithm with cautious updating criteria for nonlinear degenerate problems
- Switching stepsize strategies for sequential quadratic programming
This page was built for publication: Switching stepsize strategies for sequential quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635801)