A second-order method for the general nonlinear programming problem
From MaRDI portal
Publication:1245156
DOI10.1007/BF00933150zbMath0373.90067OpenAlexW1987778712MaRDI QIDQ1245156
Publication date: 1978
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00933150
Related Items
Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems, Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems, A globally convergent, implementable multiplier method with automatic penalty limitation, Nonconvex optimization using negative curvature within a modified linesearch, Combining and scaling descent and negative curvature directions, Preface, Improving directions of negative curvature in an efficient manner
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the global stabilization of locally convergent algorithms
- A second-order method for unconstrained optimization
- A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
- On the combination of the multiplier method of Hestenes and Powell with Newton's method
- Multiplier and gradient methods
- Use of the augmented penalty function in mathematical programming problems. I
- On the method of multipliers for mathematical programming problems
- A new approach to constrained function optimization
- The multiplier method of Hestenes and Powell applied to convex programming
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- On the method of multipliers for convex programming
- Newton’s Method for Optimization Problems with Equality Constraints
- On Penalty and Multiplier Methods for Constrained Minimization
- An Arc Method for Nonlinear Programming
- A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
- A general saddle point result for constrained optimization
- An exact penalty function for nonlinear programming with inequalities
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- The method of penalty estimates for conditional extremum problems
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- A quadratically-convergent algorithm for general nonlinear programming problems
- The Weierstrass E-Function in the Calculus of Variations
