A second-order method for the general nonlinear programming problem
From MaRDI portal
Cites work
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A general saddle point result for constrained optimization
- A new approach to constrained function optimization
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
- A quadratically-convergent algorithm for general nonlinear programming problems
- A second-order method for unconstrained optimization
- A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
- An Arc Method for Nonlinear Programming
- An exact penalty function for nonlinear programming with inequalities
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3520162 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3361691 (Why is no real title available?)
- scientific article; zbMATH DE number 3422209 (Why is no real title available?)
- Multiplier and gradient methods
- Newton’s Method for Optimization Problems with Equality Constraints
- On Penalty and Multiplier Methods for Constrained Minimization
- On the combination of the multiplier method of Hestenes and Powell with Newton's method
- On the global stabilization of locally convergent algorithms
- On the method of multipliers for convex programming
- On the method of multipliers for mathematical programming problems
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- The method of penalty estimates for conditional extremum problems
- The multiplier method of Hestenes and Powell applied to convex programming
- The Weierstrass E-Function in the Calculus of Variations
- Use of the augmented penalty function in mathematical programming problems. I
Cited in
(7)- Improving directions of negative curvature in an efficient manner
- A globally convergent, implementable multiplier method with automatic penalty limitation
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- Nonconvex optimization using negative curvature within a modified linesearch
- Combining and scaling descent and negative curvature directions
- Preface
- Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems
This page was built for publication: A second-order method for the general nonlinear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245156)