scientific article; zbMATH DE number 3248677
From MaRDI portal
Publication:5535546
Cited in
(18)- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- On the complexity of random satisfiability problems with planted solutions
- A copositive framework for analysis of hybrid Ising-classical algorithms
- Complexity and computability of solutions to linear programming systems
- Learning lyapunov functions for hybrid systems
- Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- Survey of the Theory of Extremal Problems
- A modification of the inscribed ellipsoid method
- Synthesis of cutting and separating planes in a nonsmooth optimization method
- The ellipsoid method and its implications
- The entropic barrier: exponential families, log-concave geometry, and self-concordance
- Randomized methods based on new Monte Carlo schemes for control and optimization
- Subgradient ellipsoid method for nonsmooth convex problems
- On some approaches to find Nash equilibrium in concave games
- 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
- Accuracy certificates for convex minimization with inexact oracle
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)
