Primal-dual nonlinear rescaling method with dynamic scaling parameter update
From MaRDI portal
Publication:2490335
DOI10.1007/s10107-005-0603-6zbMath1134.90494OpenAlexW2119857700MaRDI QIDQ2490335
Igor A. Griva, Roman A. Polyak
Publication date: 2 May 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0603-6
Related Items (27)
Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming ⋮ A nonlinear Lagrangian based on Fischer-Burmeister NCP function ⋮ Unified theory of augmented Lagrangian methods for constrained global optimization ⋮ Saddle point and exact penalty representation for generalized proximal Lagrangians ⋮ The Legendre Transformation in Modern Optimization ⋮ A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM ⋮ An entire space polynomial-time algorithm for linear programming ⋮ Second-order multiplier iteration based on a class of nonlinear Lagrangians ⋮ A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods ⋮ A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem ⋮ Primal-dual active-set methods for large-scale optimization ⋮ Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems ⋮ 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization ⋮ Nonlinear rescaling Lagrangians for nonconvex semidefinite programming ⋮ Saddle points of general augmented Lagrangians for constrained nonconvex optimization ⋮ A class of nonlinear Lagrangians for nonconvex second order cone programming ⋮ On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints ⋮ Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints ⋮ Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization ⋮ The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization ⋮ Primal–dual exterior point method for convex optimization ⋮ Augmented Lagrangian methods for nonlinear programming with possible infeasibility ⋮ Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones ⋮ Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach ⋮ An exterior point polynomial-time algorithm for convex quadratic programming ⋮ Unnamed Item ⋮ Lagrangian transformation and interior ellipsoid methods in convex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual nonlinear rescaling method for convex optimization
- Modified barrier functions (theory and methods)
- An interior-point algorithm for nonconvex nonlinear programming
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
- Stable exponential-penalty algorithm with superlinear convergence
- Nonlinear rescaling and proximal-like methods in convex optimization
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Computational experience with penalty-barrier methods for nonlinear programming
- The Newton modified barrier method for QP problems
- Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
- Augmented penalty algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Numerical Optimization
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- CUTE
- Symmetric Quasidefinite Matrices
- Log-sigmoid multipliers method in constrained optimization
This page was built for publication: Primal-dual nonlinear rescaling method with dynamic scaling parameter update
