scientific article; zbMATH DE number 4123531
From MaRDI portal
Publication:4204004
zbMath0685.90077MaRDI QIDQ4204004
I. I. Erlikh, Leonid G. Khachiyan, Sergey P. Tarasov
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the complexity of some basic problems in computational convexity. I. Containment problems, A modification of the inscribed ellipsoid method, Set variational inequalities, Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs, A projection cutting plane algorithm for convex programming problems, Existence and computation of short-run equilibria in economic geography, A new algorithm for minimizing convex functions over convex sets, A unifying geometric solution framework and complexity analysis for variational inequalities, A cutting plane algorithm for convex programming that uses analytic centers, Robust identification and control based on ellipsoidal parametric uncertainty descriptions, Subgradient ellipsoid method for nonsmooth convex problems, Subgradient methods for huge-scale optimization problems, A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints, Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives, Learning lyapunov functions for hybrid systems, An inequality for the volume of inscribed ellipsoids, Recursive algorithms for inner ellipsoidal approximation of convex polytopes., A cutting-plane method to nonsmooth multiobjective optimization problems, Approximating fixed points of weakly contracting mappings, A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem, Scientific contributions of Leo Khachiyan (a short overview), Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models, Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, Methods of centers for variational inequalities and linear programming, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, On the complexity of approximating the maximal inscribed ellipsoid for a polytope
