scientific article; zbMATH DE number 3248677
From MaRDI portal
Publication:5535546
zbMath0154.45001MaRDI QIDQ5535546
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the Complexity of Random Satisfiability Problems with Planted Solutions, A modification of the inscribed ellipsoid method, Unnamed Item, Subgradient ellipsoid method for nonsmooth convex problems, Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives, Learning lyapunov functions for hybrid systems, Survey of the Theory of Extremal Problems, A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem, Randomized methods based on new Monte Carlo schemes for control and optimization, Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, Synthesis of cutting and separating planes in a nonsmooth optimization method, Complexity and computability of solutions to linear programming systems, On some approaches to find Nash equilibrium in concave games, The ellipsoid method and its implications, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
