Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
- 12 November 2010
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 148 (3) , 528-549
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimizationOptimization Methods and Software, 2004
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence PropertiesSIAM Journal on Optimization, 2003
- Feasible Direction Interior-Point Technique for Nonlinear OptimizationJournal of Optimization Theory and Applications, 1998
- Convex Analysis and Minimization Algorithms II1993
- Nonsmooth Optimization1992
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical ResultsSIAM Journal on Optimization, 1992
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained OptimizationSIAM Journal on Control and Optimization, 1988
- Methods of Descent for Nondifferentiable Optimization1985
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959