On the convergence of the method of analytic centers when applied to convex quadratic programs
From MaRDI portal
Publication:2277366
Recommendations
Cites work
- scientific article; zbMATH DE number 4045481 (Why is no real title available?)
- scientific article; zbMATH DE number 4049377 (Why is no real title available?)
- scientific article; zbMATH DE number 4076974 (Why is no real title available?)
- scientific article; zbMATH DE number 4102820 (Why is no real title available?)
- scientific article; zbMATH DE number 4121759 (Why is no real title available?)
- scientific article; zbMATH DE number 4193461 (Why is no real title available?)
- scientific article; zbMATH DE number 4197759 (Why is no real title available?)
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- A new continuation method for complementarity problems with uniform P- functions
- A new polynomial-time algorithm for linear programming
- A polynomial method of approximate centers for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- Containing and shrinking ellipsoids in the path-following algorithm
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- La méthode des centres dans un espace topologique
- On the convergence of the method of analytic centers when applied to convex quadratic programs
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
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
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- Infinite-dimensional quadratic optimization: Interior-point methods and control applications
- Interior-point methods for convex programming
- A long-step barrier method for convex quadratic programming
- A cutting plane algorithm for convex programming that uses analytic centers
- Properties Of Primal Interior Point Methods For QP∗
- An analytic center quadratic cut method for the convex quadratic feasibility problem
- Quadratically constrained convex quadratic programmes: Faculty feasible regions
- Complexity analysis for certain convex programming problems
- 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
- scientific article; zbMATH DE number 4114380 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 4162679 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 4121759 (Why is no real title available?)
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)