An extension of Karmarkar's projective algorithm for convex quadratic programming
From MaRDI portal
Publication:1121792
DOI10.1007/BF01587086zbMath0674.90077MaRDI QIDQ1121792
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
polynomial-time algorithm; Karmarkar's projective algorithm; convex quadratic; interior ellipsoid method; sub-optimization
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C20: Quadratic programming
90C05: Linear programming
Related Items
A new potential reduction algorithm for smooth convex programming, Properties Of Primal Interior Point Methods For QP∗, Exterior point algorithms for nearest points and convex quadratic programs, An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming, Approximation algorithms for indefinite quadratic programming, A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions, Computational complexity of norm-maximization, Algorithms for the solution of quadratic knapsack problems, Newton-KKT interior-point methods for indefinite quadratic programming, On solving \(L_{q}\)-penalized regressions, A class of linear complementarity problems solvable in polynomial time, On affine scaling algorithms for nonconvex quadratic programming, Generalization of Karmarkar's algorithm to convex homogeneous functions, An interior point method for quadratic programs based on conjugate projected gradients, Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid, A new penalty function algorithm for convex quadratic programming, Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems, An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs, A branch bound method for subset sum problem, Duality in robust linear regression using Huber's \(M\)-estimator, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Monotone variable-metric algorithm for linearly constrained nonlinear programming, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization, Computational schemes for large-scale problems in extended linear- quadratic programming, Two-stage estimation of inequality-constrained marginal linear models with longitudinal data, An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints, An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, An interior point algorithm for global optimal solutions and KKT points, An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A monotonic projective algorithm for fractional linear programming
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- The ellipsoid method and its consequences in combinatorial optimization
- Complementary pivot theory of mathematical programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- The Simplex Method for Quadratic Programming
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- Newton-type methods for unconstrained and linearly constrained optimization
- Bimatrix Equilibrium Points and Mathematical Programming
- Minimum and Basic Solutions to Singular Linear Systems
- On the basic theorem of complementarity
