A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
From MaRDI portal
Publication:688916
DOI10.1007/BF01580601zbMATH Open0781.90073MaRDI QIDQ688916FDOQ688916
Authors: Jie Sun 
Publication date: 1 November 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
- Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming
- On affine scaling algorithms for nonconvex quadratic programming
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
- scientific article; zbMATH DE number 1785846
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
- Global convergence of the affine scaling methods for degenerate linear programming problems
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- scientific article; zbMATH DE number 4076972
interior point methodsinterior ellipsoid algorithmlocal convergence rateprimal affine-scaling method
Cites Work
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variation on Karmarkar’s algorithm for solving linear programming problems
- A modification of Karmarkar's linear programming algorithm
- Title not available (Why is that?)
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
Cited In (14)
- The convergent generalized central paths for linearly constrained convex programming
- An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables
- A feasible interior-point algorithm for nonconvex nonlinear programming
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
- An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints
- Trust region affine scaling algorithms for linearly constrained convex and concave programs
- A first-order interior-point method for linearly constrained smooth optimization
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
- A convergence analysis for a convex version of Dikin's algorithm
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
- A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems
- An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems
- On affine scaling algorithms for nonconvex quadratic programming
This page was built for publication: A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688916)
