Cutting sphere algorithm

DOI10.1023/B:JOTA.0000005451.29955.60MaRDI QIDQ597178zbMATH OpenOpenAlexFDO

Authors 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

cutting plane algorithmNonsmooth optimization algorithmsouter approximations

Mathematics Subject Classification ID

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

Recommendations

• Cutting angle methods in global optimization
• Globally convergent cutting plane method for nonconvex nonsmooth minimization
• scientific article; zbMATH DE number 1778406
• scientific article; zbMATH DE number 4095213
• A sequential cutting plane algorithm for solving convex NLP problems

Cites work

• scientific article; zbMATH DE number 1568995 (Why is no real title available?)
• Newton's method for convex programming and Tschebyscheff approximation
• On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
• Optimization. Algorithms and consistent approximations
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(1)

• Cutting a convex polyhedron out of a sphere

This page was built for publication: Cutting sphere algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q597178)