Nonsmooth bundle trust-region algorithm with applications to robust stability
From MaRDI portal
Abstract: We propose a bundle trust-region algorithm to minimize locally Lipschitz functions which are potentially nonsmooth and nonconvex. We prove global convergence of our method and show by way of an example that the classical convergence argument in trust-region methods based on the Cauchy point fails in the nonsmooth setting. Our method is tested experimentally on three problems in automatic control.
Recommendations
- A class of nonmonotone stabilization trust region methods
- Trust Region Algorithms for Solving Nonsmooth Equations
- A trust region algorithm for nonsmooth optimization
- scientific article; zbMATH DE number 810434
- A trust region method for nonsmooth optimization
- scientific article; zbMATH DE number 679863
- A trust region method for nonlinear system
- A Robust Trust Region Method for Constrained Nonlinear Programming Problems
- scientific article; zbMATH DE number 1501233
- A trust region method for nonsmooth convex optimization
Cites work
- A Chain Rule for Essentially Smooth Lipschitz Functions
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A proximity control algorithm to minimize nonsmooth and nonconvex functions
- A proximity control algorithm to minimize nonsmooth and nonconvex semi-infinite maximum eigenvalue functions
- A redistributed proximal bundle method for nonconvex optimization
- A Spectral Bundle Method for Semidefinite Programming
- A spectral bundle method with bounds
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An aggregate subgradient method for nonsmooth convex minimization
- Approximate convexity and submonotonicity.
- Bundle method for nonconvex nonsmooth constrained optimization
- Checking robust nonsingularity is NP-hard
- Clarke Subgradients of Stratifiable Functions
- Composite proximal bundle method
- Computational complexity of μ calculation
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Cutting plane oracles to minimize non-smooth non-convex functions
- Differential properties of the spectral abscissa and the spectral radius for analytic matrix-valued mappings
- Generalized Bundle Methods
- Global optimization with polynomials and the problem of moments
- Globally convergent DC trust-region methods
- GloptiPoly
- scientific article; zbMATH DE number 1001726 (Why is no real title available?)
- scientific article; zbMATH DE number 3868525 (Why is no real title available?)
- scientific article; zbMATH DE number 16326 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 624773 (Why is no real title available?)
- scientific article; zbMATH DE number 1534297 (Why is no real title available?)
- scientific article; zbMATH DE number 4119948 (Why is no real title available?)
- Integral global minimization: Algorithms, implementations and numerical tests
- IQC analysis and synthesis via nonsmooth optimization
- Nonconvex bundle method with application to a delamination problem
- Nonlinear optimization.
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Nonsmooth H∞Synthesis
- Nonsmooth optimization for multidisk \(H_\infty\) synthesis
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On the Lidskii--Vishik--Lyusternik Perturbation Theory for Eigenvalues of Matrices with Arbitrary Jordan Structure
- Optimization and nonsmooth analysis
- Parametric Robust Structured Control Design
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Pseudospectral mapping theorem. II.
- Semismooth and Semiconvex Functions in Constrained Optimization
- Submonotone Subdifferentials of Lipschitz Functions
- Trust Region Methods
- Variational Analysis
Cited in
(18)- Non-smooth optimization for robust control of infinite-dimensional systems
- Boundary control of partial differential equations using frequency domain optimization techniques
- Spectral projected subgradient method for nonsmooth convex optimization problems
- A proximity control algorithm to minimize nonsmooth and nonconvex functions
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Branch and bound algorithm with applications to robust stability
- Optimizing the Kreiss constant
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Worst-case stability and performance with mixed parametric and dynamic uncertainties
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- Mixed ‐synthesis for ‐stability
- Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm
- A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
- Bundle trust region algorithm based on linear subproblem
This page was built for publication: Nonsmooth bundle trust-region algorithm with applications to robust stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255187)
