The polynomial solvability of convex quadratic programming
From MaRDI portal
Publication:3947451
DOI10.1016/0041-5553(80)90098-1zbMath0486.90068OpenAlexW1993200481MaRDI QIDQ3947451
M. K. Kozlov, Sergey P. Tarasov, Leonid G. Khachiyan
Publication date: 1980
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(80)90098-1
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10) Turing machines and related notions (03D10)
Related Items (37)
Integration of expert knowledge into radial basis function surrogate models ⋮ Packing Under Convex Quadratic Constraints ⋮ On the closest point to the origin in transportation polytopes ⋮ Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming ⋮ Optimization of computations ⋮ Efficient accuracy evaluation for multi-modal sensed data ⋮ Active Set Methods with Reoptimization for Convex Quadratic Integer Programming ⋮ Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs ⋮ IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming ⋮ Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis ⋮ Formal lumping of polynomial differential equations through approximate equivalences ⋮ On probability-raising causality in Markov decision processes ⋮ Foundations of probability-raising causality in Markov decision processes ⋮ Space splitting convexification: a local solution method for nonconvex optimal control problems ⋮ The problem of identifying the model of substitution of production factors ⋮ Unnamed Item ⋮ Statistical modeling under partial identification: distinguishing three types of identification regions in regression analysis with interval data ⋮ Polynomial-time algorithms for submodular Laplacian systems ⋮ Computational aspects of the colorful Carathéodory theorem ⋮ Lipschitz continuity and approximate equilibria ⋮ The fairest core in cooperative games with transferable utilities ⋮ Range assignment of base-stations maximizing coverage area without interference ⋮ Computing Walrasian equilibria: fast algorithms and structural properties ⋮ The stable \(b\)-matching polytope revisited ⋮ The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential ⋮ A fast algorithm for non-negativity model selection ⋮ Monotone Learning with Rectified Wire Networks ⋮ A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs ⋮ Polyhedral Aspects of Stable Marriage ⋮ On the complexity of finding a local minimizer of a quadratic function over a polytope ⋮ Passive Nonlinear Dendritic Interactions as a Computational Resource in Spiking Neural Networks ⋮ Reconstruction of uncertain historical evolution of the polysyllablization of Chinese lexis ⋮ Comparison of algorithms for simple stochastic games ⋮ Investigation of optimization methods and their applications ⋮ The clique problem for graphs with a few eigenvalues of the same sign ⋮ Packing under convex quadratic constraints ⋮ Mechanism Design for Correlated Valuations: Efficient Methods for Revenue Maximization
This page was built for publication: The polynomial solvability of convex quadratic programming
