Nonsmooth bundle trust-region algorithm with applications to robust stability
From MaRDI portal
Publication:255187
DOI10.1007/s11228-015-0352-5zbMath1334.49092arXiv1504.00648OpenAlexW1892869851MaRDI QIDQ255187
Laleh Ravanbod, Dominikus Noll, Pierre Apkarian
Publication date: 9 March 2016
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.00648
global convergenceminimizationCauchy pointdistance to instabilitynonsmooth bundle trust-region algorithmparametric robustnessworst-case \(H_\infty\)-norm
Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) (H^infty)-control (93B36) Eigenvalue problems (93B60) Robust stability (93D09)
Related Items
A Trust-region Method for Nonsmooth Nonconvex Optimization, A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, Non-smooth optimization for robust control of infinite-dimensional systems, Mixed ‐synthesis for ‐stability, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, Spectral projected subgradient method for nonsmooth convex optimization problems, Optimizing the Kreiss Constant, Branch and bound algorithm with applications to robust stability, Worst‐case stability and performance with mixed parametric and dynamic uncertainties, An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space, Boundary control of partial differential equations using frequency domain optimization techniques, Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
Uses Software
Cites Work
- Nonconvex bundle method with application to a delamination problem
- Composite proximal bundle method
- Cutting plane oracles to minimize non-smooth non-convex functions
- IQC analysis and synthesis via nonsmooth optimization
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- A spectral bundle method with bounds
- Approximate convexity and submonotonicity.
- Checking robust nonsingularity is NP-hard
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- Integral global minimization: Algorithms, implementations and numerical tests
- Globally convergent DC trust-region methods
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Pseudospectral mapping theorem. II.
- Nonsmooth optimization for multidisk \(H_\infty\) synthesis
- Global Optimization with Polynomials and the Problem of Moments
- Parametric Robust Structured Control Design
- An aggregate subgradient method for nonsmooth convex minimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Clarke Subgradients of Stratifiable Functions
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Optimization and nonsmooth analysis
- Submonotone Subdifferentials of Lipschitz Functions
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Semismooth and Semiconvex Functions in Constrained Optimization
- Computational complexity of μ calculation
- Differential properties of the spectral abscissa and the spectral radius for analytic matrix-valued mappings
- Variational Analysis
- On the Lidskii--Vishik--Lyusternik Perturbation Theory for Eigenvalues of Matrices with Arbitrary Jordan Structure
- A Chain Rule for Essentially Smooth Lipschitz Functions
- Trust Region Methods
- A Spectral Bundle Method for Semidefinite Programming
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Generalized Bundle Methods
- Nonsmooth H∞Synthesis
- GloptiPoly
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
