scientific article; zbMATH DE number 3248677
From MaRDI portal
Publication:5535546
zbMATH Open0154.45001MaRDI QIDQ5535546FDOQ5535546
Publication date: 1965
Title of this publication is not available (Why is that?)
Cited In (18)
- Complexity and computability of solutions to linear programming systems
- Title not available (Why is that?)
- Subgradient ellipsoid method for nonsmooth convex problems
- Survey of the Theory of Extremal Problems
- On the Complexity of Random Satisfiability Problems with Planted Solutions
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- Randomized methods based on new Monte Carlo schemes for control and optimization
- On some approaches to find Nash equilibrium in concave games
- Synthesis of cutting and separating planes in a nonsmooth optimization method
- Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models
- Learning lyapunov functions for hybrid systems
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives
- A copositive framework for analysis of hybrid Ising-classical algorithms
- Accuracy certificates for convex minimization with inexact oracle
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- The ellipsoid method and its implications
- A modification of the inscribed ellipsoid method
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5535546)
