A new algorithm for minimizing convex functions over convex sets
type: Item
instance of: scholarly article
title: A new algorithm for minimizing convex functions over convex sets
zbMATH Open document ID: 0852.90112
DOI: 10.1007/BF02592216
author: Pravin M. Vaidya
published in: Mathematical Programming. Series A. Series B
publication date: 1996-12-09T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 907967
zbMATH Keywords: oracle
zbMATH Keywords: convex optimization
zbMATH Keywords: volumetric center of a polytope
zbMATH Keywords: ellipsoid of maximum volume
zbMATH Keywords: global convergence rate
describes a project that uses: ACCPM
MaRDI profile type: Publication
cites work: Q5842044
cites work: Q5800951
cites work: Matrix multiplication via arithmetic progressions
cites work: Q3738922
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Cutting planes and column generation techniques with the projective algorithm
cites work: A Potential Reduction Algorithm Allowing Column Generation
cites work: Q4204004
Recommended article: Q4499054
Recommended article: Q3343782
Recommended article: A Descent Algorithm for Minimizing Polyhedral Convex Functions
Recommended article: Method for minimizing a convex-concave function over a convex set
Recommended article: A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
Recommended article: An algorithm for maximizing a convex function over a simple set
Recommended article: A branch and bound-outer approximation algorithm for concave minimization over a convex set
Recommended article: New Proximal Point Algorithms for Convex Minimization
Recommended article: Minimisation de fonctionnelles dans un ensemble de fonctions convexes
Recommended article: A \(\mathcal{VU}\)-algorithm for convex minimization
description: scientific article; zbMATH DE number 907967