Cutting Sphere Algorithm

E. Polak and J.O. Royset
Additional contact information
E. Polak: University of California
J.O. Royset: University of California

Journal of Optimization Theory and Applications, 2003, vol. 119, issue 2, No 8, 379-385

Abstract: Abstract We present a generalization of the conventional cutting plane algorithm for the solution of nonconvex optimization problems with nonsmooth inequality constraints. The cuts are effected using spheres rather than hyperplanes.

Keywords: Nonsmooth optimization algorithms; outer approximations; cutting plane algorithm (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/B:JOTA.0000005451.29955.60 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:119:y:2003:i:2:d:10.1023_b:jota.0000005451.29955.60

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/B:JOTA.0000005451.29955.60

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().