A deep cut ellipsoid algorithm for convex programming: Theory and applications

DOI10.1007/BF01582060zbMath0791.90041OpenAlexW2083880788MaRDI QIDQ1315434

J. B. G. Frenk, Shu-Zhong Zhang, Joaquim A. S. Gromicho

Publication date: 10 March 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582060

zbMATH Keywords

rate of convergenceellipsoid algorithmcontinuous convex programmingdeep cutmin-max stochastic queue location

Mathematics Subject Classification ID

Convex programming (90C25) Continuous location (90B85) Queues and service in operations research (90B22) Existence of solutions for minimax problems (49J35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (max. 100)

Quasi-maximum likelihood estimation for conditional quantiles ⋮ Simplices by point-sliding and the Yamnitsky-Levin algorithm ⋮ Dominating sets for convex functions with some applications ⋮ An improved ellipsoid method for solving convex differentiable optimization problems ⋮ Computational geometry of positive definiteness ⋮ An entire space polynomial-time algorithm for linear programming ⋮ Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method ⋮ General models in min-max continuous location: Theory and solution techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exercises in integration. Transl. from the French by J. M. Cole
• Karmarkar's algorithm and the ellipsoid method
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• Workloads and waiting times in single-server systems with multiple customer classes
• General models in min-max continuous location: Theory and solution techniques
• An ellipsoid algorithm for nonlinear programming
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Variable metric relaxation methods, part II: The ellipsoid method
• Optimal Server Location on a Network Operating as an M/G/1 Queue
• Using Block Norms for Location Modeling
• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• Using deep cuts in an ellipsoid algorithm for nonlinear programming
• On the Solution of Variational Inequalities by the Ellipsoid Method
• Family of algorithms for solving convex programming problems
• Feature Article—The Ellipsoid Method: A Survey
• Convergence Rates of the Ellipsoid Method on General Convex Functions
• Extremum problems in the presence of restrictions
• Convergence rate of the gradient descent method with dilatation of the space

This page was built for publication: A deep cut ellipsoid algorithm for convex programming: Theory and applications