scientific article
From MaRDI portal
Publication:3873927
zbMath0434.90071MaRDI QIDQ3873927
M. K. Kozlov, Leonid G. Khachiyan, Sergey P. Tarasov
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Quadratic programming (90C20)
Related Items
Spectral bounds for the clique and independence numbers of graphs, A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks, Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces, Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, A simple bilinear optimization problem, Objective functions and the complexity of policy design, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, A nonlinear knapsack problem, Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem, An extension of Karmarkar's projective algorithm for convex quadratic programming, Interior path following primal-dual algorithms. II: Convex quadratic programming, Measures of conflict, basic axioms and their application to the clusterization of a body of evidence, The symmetric quadratic knapsack problem: approximation and scheduling applications, On tail dependence matrices. The realization problem for parametric families, Approximation of the quadratic set covering problem, Learning Polytopes with Fixed Facet Directions, An approximation algorithm for indefinite mixed integer quadratic programming, An interior-exterior approach for convex quadratic programming, Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm, Active constraints, indefinite quadratic test problems, and complexity, Efficient methods for selfish network design, On finding global optima for the hinge fitting problem., The weighted Euclidean 1-center problem, Selfish splittable flows and NP-completeness, Quadratic programming with one negative eigenvalue is NP-hard, On solving \(L_{q}\)-penalized regressions, Two counterexamples on the polynomial solvability of the linear complementarity problem, Complexity analysis of a linear complementarity algorithm based on a Lyapunov function, Scientific contributions of Leo Khachiyan (a short overview), A polynomial algorithm for an integer quadratic non-separable transportation problem, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, An algebraic approach to integer portfolio problems, Design and simulation of a real-time implementable energy-efficient model-predictive cruise controller for electric vehicles, Quadratic programming and combinatorial minimum weight product problems, Bayesian incentive compatibility via matchings, Containing and shrinking ellipsoids in the path-following algorithm, Approachability in repeated games: Computational aspects and a Stackelberg variant, Computational complexity of norm-maximization, A polynomial algorithm for minimum quadratic cost flow problems, Optimal scaling of balls and polyhedra, On solving the densestk-subgraph problem on large graphs, Interior-point algorithms for global optimization, An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs, A new technique for generating quadratic programming test problems, Algorithms for the solution of quadratic knapsack problems, Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
