A class of primal affine scaling algorithms
From MaRDI portal
Publication:427024
DOI10.1016/j.amc.2011.10.034zbMath1250.65076MaRDI QIDQ427024
A. W. M. Pinto, F. G. M. Cunha, João Xavier da Cruz Neto, Paulo Roberto Oliveira
Publication date: 13 June 2012
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.10.034
weak convergence; numerical results; quadratic programming; interior point algorithms; linear programs; affine scaling algorithms; linear convex programming
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C20: Quadratic programming
90C05: Linear programming
Related Items
Uses Software
Cites Work
- Multiplicative iterative algorithms for convex programming
- A simple characterization of solutions sets of convex programs
- Minimizing a differentiable function over a differential manifold
- Subgradient algorithm on Riemannian manifolds
- Smooth nonlinear optimization of \(\mathbb R^n\)
- On the \(\epsilon\)-perturbation method for avoiding degeneracy
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
- An interior point multiplicative method for optimization under positivity constraints
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- A repository of convex quadratic programming problems
- Proximal Point Algorithm On Riemannian Manifolds
- The Gradient Projection Method Along Geodesics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
