A deep cut ellipsoid algorithm for convex programming: Theory and applications
type: Item
instance of: scholarly article
title: A deep cut ellipsoid algorithm for convex programming: Theory and applications
zbMATH Open document ID: 0791.90041
DOI: 10.1007/BF01582060
author: J. B. G. Frenk
author: Joaquim A. S. Gromicho
author: Shuzhong Zhang
published in: Mathematical Programming. Series A. Series B
publication date: 1994-03-10T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 49J35
zbMATH DE Number: 513295
zbMATH Keywords: deep cut
zbMATH Keywords: ellipsoid algorithm
zbMATH Keywords: continuous convex programming
zbMATH Keywords: rate of convergence
zbMATH Keywords: min-max stochastic queue location
MaRDI profile type: Publication
cites work: Optimal Server Location on a Network Operating as an M/G/1 Queue
cites work: Feature Article—The Ellipsoid Method: A Survey
cites work: Workloads and waiting times in single-server systems with multiple customer classes
cites work: Extremum problems in the presence of restrictions
cites work: Using deep cuts in an ellipsoid algorithm for nonlinear programming
cites work: An ellipsoid algorithm for nonlinear programming
cites work: A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
cites work: Q4296824
cites work: General models in min-max continuous location: Theory and solution techniques
cites work: Exercises in integration. Transl. from the French by J. M. Cole
cites work: Convergence Rates of the Ellipsoid Method on General Convex Functions
cites work: Variable metric relaxation methods, part II: The ellipsoid method
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Geometric algorithms and combinatorial optimization
cites work: Q3970132
cites work: Q3050157
cites work: Q4101255
cites work: Q3222981
cites work: On the Solution of Variational Inequalities by the Ellipsoid Method
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Q4040221
cites work: Q3243222
cites work: Convergence rate of the gradient descent method with dilatation of the space
cites work: Family of algorithms for solving convex programming problems
cites work: Q3215459
cites work: Using Block Norms for Location Modeling
cites work: Karmarkar's algorithm and the ellipsoid method
cites work: Q4088614
cites work: Q4097094
full work available at URL: https://doi.org/10.1007/bf01582060
OpenAlex ID: W2083880788
description: scientific article; zbMATH DE number 513295