Primal–dual exterior point method for convex optimization
From MaRDI portal
Publication:5459822
DOI10.1080/10556780701363065zbMATH Open1191.90039OpenAlexW1993452616MaRDI QIDQ5459822FDOQ5459822
Authors: Roman A. Polyak 
Publication date: 29 April 2008
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780701363065
Recommendations
- A Primal-Dual Exterior Point Method for Nonlinear Optimization
- scientific article; zbMATH DE number 1024637
- scientific article
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Primal-dual point method for nonlinear programming
- scientific article; zbMATH DE number 964349
- An exterior point method for the convex programming problem
- scientific article
- Primal-dual subgradient methods for convex problems
- A primal-dual proximal point algorithm for constrained convex programs
dualitynonlinear rescalingquadratic convergence rateprimal-dual exterior point methodinterior quadratic prox
Cites Work
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Title not available (Why is that?)
- Smooth Optimization Methods for Minimax Problems
- On the convergence of the exponential multiplier method for convex programming
- Modified barrier functions (theory and methods)
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Primal-dual nonlinear rescaling method for convex optimization
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Cubic regularization of Newton method and its global performance
- Definite and Semidefinite Quadratic Forms
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Log-sigmoid multipliers method in constrained optimization
- Nonlinear rescaling as interior quadratic prox method in convex optimization
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- Numerical experiments with an interior-exterior point method for nonlinear programming
Cited In (10)
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- A penalty-interior-point algorithm for nonlinear constrained optimization
- A Primal-Dual Exterior Point Method for Nonlinear Optimization
- Title not available (Why is that?)
- Primal-dual nonlinear rescaling method for convex optimization
- An exterior point method for the convex programming problem
- Title not available (Why is that?)
- An entire space polynomial-time algorithm for linear programming
- An exterior point polynomial-time algorithm for convex quadratic programming
This page was built for publication: Primal–dual exterior point method for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459822)
