Primal-dual nonlinear rescaling method for convex optimization
From MaRDI portal
Publication:852150
DOI10.1023/B:JOTA.0000041733.24606.99zbMath1129.90339MaRDI QIDQ852150
Igor A. Griva, Roman A. Polyak
Publication date: 27 November 2006
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51)
Related Items (23)
A nonlinear Lagrangian based on Fischer-Burmeister NCP function ⋮ A classification problem of credit risk rating investigated and solved by optimisation of the ROC curve ⋮ Unified theory of augmented Lagrangian methods for constrained global optimization ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Primal-dual nonlinear rescaling method for convex optimization ⋮ Nonlinear rescaling as interior quadratic prox method in convex optimization ⋮ Interior/exterior-point methods with inertia correction strategy for solving optimal reactive power flow problems with discrete variables ⋮ Modified Lagrangian methods for separable optimization problems ⋮ 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 primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem ⋮ Support vector machine via nonlinear rescaling method ⋮ 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization ⋮ The Wonham filter under uncertainty: A game-theoretic approach ⋮ A class of nonlinear Lagrangians for nonconvex second order cone programming ⋮ Primal-dual nonlinear rescaling method with dynamic scaling parameter update ⋮ Some first-order algorithms for total variation based image restoration ⋮ 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 ⋮ An exterior point polynomial-time algorithm for convex quadratic programming ⋮ Unnamed Item
Uses Software
Cites Work
- 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
- Nonlinear rescaling and proximal-like methods in convex optimization
- Interior-point methods
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Computational experience with penalty-barrier methods for nonlinear programming
- Smoothing methods for convex inequalities and linear complementarity problems
- 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
- Symmetric Quasidefinite Matrices
- Definite and Semidefinite Quadratic Forms
- Log-sigmoid multipliers method in constrained optimization
This page was built for publication: Primal-dual nonlinear rescaling method for convex optimization
