A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems
From MaRDI portal
Publication:2350402
Recommendations
- Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints
- A nonlinear Lagrangian for constrained optimization problems
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- Convergence analysis of a nonlinear Lagrange method for optimization problems over nonlinear second-order cones
- A modified Lagrangian algorithm for solving nonlinear constrained optimization problems
Cites work
- 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization
- A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A modified barrier-augmented Lagrangian method for constrained minimization
- A modified Lagrangian algorithm for solving nonlinear constrained optimization problems
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Log-sigmoid multipliers method in constrained optimization
- Modified barrier functions (theory and methods)
- Multiplier and gradient methods
- Nonlinear leastpth optimization and nonlinear programming
- Stable exponential-penalty algorithm with superlinear convergence
- The method of penalty estimates for conditional extremum problems
- The multiplier method of Hestenes and Powell applied to convex programming
- Zero duality gap for a class of nonconvex optimization problems
Cited in
(8)- Analysis and implementation of a dual algorithm for constrained optimization
- Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints
- A class of nonlinear Lagrangian algorithms for minimax problems
- Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization
- Convergence analysis of a nonlinear Lagrangian method for nonconvex semidefinite programming with subproblem inexactly solved
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- A modified Lagrangian algorithm for solving nonlinear constrained optimization problems
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
This page was built for publication: A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350402)