The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function

Cites Work

Unnamed Item
The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
Modified barrier functions (theory and methods)
A modified barrier-augmented Lagrangian method for constrained minimization
Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
Zero duality gap for a class of nonconvex optimization problems
Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
A nonsmooth version of Newton's method
1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization
Multiplier and gradient methods
An Augmented Lagrangian Function with Improved Exactness Properties
Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
On Penalty and Multiplier Methods for Constrained Minimization
Semismooth and Semiconvex Functions in Constrained Optimization
A dual approach to solving nonlinear programming problems by unconstrained optimization
The method of penalty estimates for conditional extremum problems
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
A new method for the optimization of a nonlinear function subject to nonlinear constraints
Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
Definite and Semidefinite Quadratic Forms
Log-sigmoid multipliers method in constrained optimization

This page was built for publication: The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity