A nonlinear Lagrangian based on Fischer-Burmeister NCP function
From MaRDI portal
Publication:2372014
Recommendations
- Nonlinear Lagrangians for nonlinear programming based on modified Fischer-Burmeister NCP functions
- Nonlinear Lagrangians based on the modified F-B NCP functions
- A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
- A nonlinear Lagrangian for constrained optimization problems
- A nonlinear Lagrangian for optimization problems with inequality constraints
Cites work
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1069180 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A modified barrier-augmented Lagrangian method for constrained minimization
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Augmented non-quadratic penalty algorithms
- Enlarging the region of convergence of Newton's method for constrained optimization
- Log-sigmoid multipliers method in constrained optimization
- Modified barrier functions (theory and methods)
- Multiplier and gradient methods
- Nonlinear leastpth optimization and nonlinear programming
- Nonlinear rescaling and proximal-like methods in convex optimization
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Primal-dual nonlinear rescaling method for convex optimization
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- Smooth Optimization Methods for Minimax Problems
- Stable exponential-penalty algorithm with superlinear convergence
- The multiplier method of Hestenes and Powell applied to convex programming
- Unconstrained Lagrangians in Nonlinear Programming
- Zero duality gap for a class of nonconvex optimization problems
Cited in
(9)- Nonlinear Lagrangians based on the modified F-B NCP functions
- Nonlinear Lagrangians for nonlinear programming based on modified Fischer-Burmeister NCP functions
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- A nonlinear Lagrangian for optimization problems with inequality constraints
- A nonlinear Lagrangian for constrained optimization problems
- The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization
- A class of new Lagrangian multiplier method with NCP function
- A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
- A penalized Fischer-Burmeister NCP-function
This page was built for publication: A nonlinear Lagrangian based on Fischer-Burmeister NCP function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372014)