A sequential quadratic programming method for potentially infeasible mathematical programs
- 1 May 1989
- journal article
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 139 (2), 319-351
- https://doi.org/10.1016/0022-247x(89)90111-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A variant of Karmarkar's linear programming algorithm for problems in standard formMathematical Programming, 1987
- Globally convergent algorithm for nonlinearly constrained optimization problemsJournal of Optimization Theory and Applications, 1987
- Lipschitzian properties of multifunctionsNonlinear Analysis, 1985
- Extensions of subgradient calculus with applications to optimizationNonlinear Analysis, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search functionNumerische Mathematik, 1982
- A globally convergent method for nonlinear programmingJournal of Optimization Theory and Applications, 1977
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear SystemsSIAM Journal on Numerical Analysis, 1976
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithmsMathematical Programming, 1974
- Lower Semicontinuity of Multivalued Linearization MappingsSIAM Journal on Control, 1973