Cutting plane oracles to minimize non-smooth non-convex functions

DOI10.1007/s11228-010-0159-3zbMath1219.49013OpenAlexW1969341787MaRDI QIDQ618887

Dominikus Noll

Publication date: 17 January 2011

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-010-0159-3

zbMATH Keywords

non-smooth optimizationbundle methodcutting plane oracle

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) (H^infty)-control (93B36)

Related Items

A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions ⋮ Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems ⋮ On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity ⋮ Optimization conditions and decomposable algorithms for convertible nonconvex optimization ⋮ Robustness via structuredH_∞/H_∞synthesis ⋮ An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ Design of a flight control architecture using a non-convex bundle method ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information ⋮ A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities ⋮ Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality ⋮ Worst‐case stability and performance with mixed parametric and dynamic uncertainties ⋮ A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ Minimizing memory effects of a system ⋮ Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values ⋮ A filter proximal bundle method for nonsmooth nonconvex constrained optimization ⋮ Robust eigenstructure clustering by non-smooth optimisation ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data ⋮ A new data-driven robust optimization approach to multi-item newsboy problems ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Nonsmooth bundle trust-region algorithm with applications to robust stability

Uses Software

• PLCP
• SQPlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proximal method for composite minimization
• IQC analysis and synthesis via nonsmooth optimization
• Nonsmooth optimization for multiband frequency domain control design
• Convergence of some algorithms for convex minimization
• Approximate convexity and submonotonicity.
• Nonsmooth optimization for multidisk \(H_\infty\) synthesis
• An aggregate subgradient method for nonsmooth convex minimization
• A Redistributed Proximal Bundle Method for Nonconvex Optimization
• Time domain constrained H _∞ -synthesis
• Controller Design via Nonsmooth Multidirectional Search
• A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
• Submonotone Subdifferentials of Lipschitz Functions
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results