Using two successive subgradients in the ellipsoid method for nonlinear programming

DOI10.1007/BF02192217zbMath0824.90109OpenAlexW1999402657MaRDI QIDQ1337226

Sehun Kim, Kun-Nyeong Chang, Dongwoo Kim

Publication date: 9 November 1995

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth convex optimizationellipsoid methodalternative cuts

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• Unnamed Item
• A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming
• An ellipsoid algorithm for nonlinear programming
• A class of rank-two ellipsoid algorithms for convex programming
• 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
• On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid

This page was built for publication: Using two successive subgradients in the ellipsoid method for nonlinear programming