On the convergence of the method of analytic centers when applied to convex quadratic programs
DOI10.1007/BF01588796zbMATH Open0725.90076OpenAlexW2044908666MaRDI QIDQ2277366FDOQ2277366
Publication date: 1991
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588796
Recommendations
Newton's methodpolynomial time complexityconvex quadratic programsmethod of analytic centersestimation of the speed of convergence
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- A new continuation method for complementarity problems with uniform P- functions
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- La méthode des centres dans un espace topologique
- Containing and shrinking ellipsoids in the path-following algorithm
- On the convergence of the method of analytic centers when applied to convex quadratic programs
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- A polynomial method of approximate centers for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (27)
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Infinite-dimensional quadratic optimization: Interior-point methods and control applications
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- Interior-point methods for convex programming
- A long-step barrier method for convex quadratic programming
- Properties Of Primal Interior Point Methods For QP∗
- A cutting plane algorithm for convex programming that uses analytic centers
- An analytic center quadratic cut method for the convex quadratic feasibility problem
- Complexity analysis for certain convex programming problems
- Quadratically constrained convex quadratic programmes: Faculty feasible regions
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- A combined homotopy interior point method for convex nonlinear programming
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- Utility function programs and optimization over the efficient set in multiple-objective decision making
- On computing the center of a convex quadratically constrained set
- Title not available (Why is that?)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
- A polynomial time dual algorithm for the Euclidean multifacility location problem
- Title not available (Why is that?)
- Interior-point algorithm for quadratically constrained entropy minimization problems
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- Impproving the rate of convergence of the logarithmic barrier function method
- On the convergence of the method of analytic centers when applied to convex quadratic programs
- An exterior point polynomial-time algorithm for convex quadratic programming
- A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
- Title not available (Why is that?)
This page was built for publication: On the convergence of the method of analytic centers when applied to convex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277366)
