An extension of Karmarkar's projective algorithm for convex quadratic programming

From MaRDI portal

Publication:1121792

Jump to:navigation, search

DOI10.1007/BF01587086zbMath0674.90077OpenAlexW1982929029MaRDI QIDQ1121792

Edison Tse, Yinyu Ye

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01587086

zbMATH Keywords

polynomial-time algorithm Karmarkar's projective algorithm convex quadratic interior ellipsoid method sub-optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Linear programming (90C05)

Related Items

An efficient logarithmic barrier method without line search for convex quadratic programming, A positive and stable L2-minimization based moment method for the Boltzmann equation of gas dynamics, An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity, A branch bound method for subset sum problem, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming, An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, A logarithmic barrier approach for linear programming, Duality in robust linear regression using Huber's \(M\)-estimator, Robustness to rank reversal in pairwise comparison matrices based on uncertainty bounds, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Newton-KKT interior-point methods for indefinite quadratic programming, \(\Gamma\)-robust optimization of project scheduling problems, Measures of conflict, basic axioms and their application to the clusterization of a body of evidence, On tail dependence matrices. The realization problem for parametric families, Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables, A polynomial arc-search interior-point algorithm for convex quadratic programming, Decentralized iterative learning control for constrained collaborative tracking, CECM: constrained evidential \(C\)-means algorithm, An interior-exterior approach for convex quadratic programming, Optimal portfolio execution under time-varying liquidity constraints, Properties Of Primal Interior Point Methods For QP^∗, A class of linear complementarity problems solvable in polynomial time, On solving \(L_{q}\)-penalized regressions, Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs, Polynomial-time algorithms for submodular Laplacian systems, Novel interior point algorithms for solving nonlinear convex optimization problems, On affine scaling algorithms for nonconvex quadratic programming, Generalization of Karmarkar's algorithm to convex homogeneous functions, 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, 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 interior point algorithm for global optimal solutions and KKT points, An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?, A new potential reduction algorithm for smooth convex programming, Extension of a projective interior point method for linearly constrained convex programming, New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints, An interior point method for quadratic programs based on conjugate projected gradients, Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization, Computational schemes for large-scale problems in extended linear- quadratic programming, Computational complexity of norm-maximization, Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid, Optimal pricing policy design for selling cost-reducing innovation in Cournot games, A new penalty function algorithm for convex quadratic programming, A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs, Monotone variable-metric algorithm for linearly constrained nonlinear programming, On the convergence analysis of arc search interior point methods for LCPs, An exterior point polynomial-time 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, Algorithms for the solution of quadratic knapsack problems

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1121792&oldid=13170843"