Cutting sphere algorithm

DOI10.1023/B:JOTA.0000005451.29955.60zbMath1055.90085OpenAlexW2042767148MaRDI QIDQ597178

Elijah Polak, Johannes O. Royset

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1023/b:jota.0000005451.29955.60

zbMATH Keywords

outer approximationscutting plane algorithmNonsmooth optimization algorithms

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Newton's method for convex programming and Tschebyscheff approximation
• Optimization. Algorithms and consistent approximations
• The Cutting-Plane Method for Solving Convex Programs
• On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms

This page was built for publication: Cutting sphere algorithm