Trust region affine scaling algorithms for linearly constrained convex and concave programs
From MaRDI portal
Publication:1380941
DOI10.1007/BF01581170zbMath0901.90166OpenAlexW2157036632MaRDI QIDQ1380941
Renato D. C. Monteiro, Yan-Hui Wang
Publication date: 11 March 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581170
interior point methodlinearly constrained convex or concave programmingtrust region affine scaling algorithm
Related Items
A trust region affine scaling method for bound constrained optimization, A partial first-order affine-scaling method, A first-order interior-point method for linearly constrained smooth optimization, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming, An affine scaling method for optimization problems with polyhedral constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- A continuous approach to inductive inference
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
- A new polynomial-time algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Global convergence of the affine scaling methods for degenerate linear programming problems
- An interior point algorithm to solve computationally difficult set covering problems
- On affine scaling algorithms for nonconvex quadratic programming
- On the convergence of the affine-scaling algorithm
- A simplified global convergence proof of the affine scaling algorithm
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
- An implementation of Karmarkar's algorithm for linear programming
- Superlinear primal-dual affine scaling algorithms for LCP
- A convergence analysis for a convex version of Dikin's algorithm
- Superlinear convergence of the affine scaling algorithm
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- A variation on Karmarkar’s algorithm for solving linear programming problems
- The Affine Scaling Algorithm Fails for Stepsize 0.999
- Computing a Trust Region Step
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Computing Optimal Locally Constrained Steps
- Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming
- The trust region affine interior point algorithm for convex and nonconvex quadratic programming
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- A method for the solution of certain non-linear problems in least squares
