Bundle method for non-convex minimization with inexact subgradients and function values
From MaRDI portal
Recommendations
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- A splitting bundle approach for non-smooth non-convex minimization
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- scientific article; zbMATH DE number 16626
Cites work
- A bisection method for computing the \(H_{\infty}\) norm of a transfer matrix and related problems
- A bundle-Newton method for nonsmooth unconstrained minimization
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A fast algorithm to compute the \(H_{\infty}\)-norm of a transfer function matrix
- A linearization algorithm for optimizing control systems subject to singular value inequalities
- A proximal bundle method based on approximate subgradients
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A proximal method for composite minimization
- A proximity control algorithm to minimize nonsmooth and nonconvex semi-infinite maximum eigenvalue functions
- A quasi-second-order proximal bundle algorithm
- A redistributed proximal bundle method for nonconvex optimization
- A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Algorithms for the design of control systems subject to singular value inequalities
- An aggregate subgradient method for nonsmooth convex minimization
- An Algorithm for Nonsmooth Convex Minimization With Errors
- An inexact bundle variant suited to column generation
- Approximate convexity and submonotonicity.
- Approximations in proximal bundle methods and decomposition of convex programs
- Composite proximal bundle method
- Computer-aided design via optimization: A review
- Controller Design via Nonsmooth Multidirectional Search
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Cutting plane oracles to minimize non-smooth non-convex functions
- Design of a flight control architecture using a non-convex bundle method
- scientific article; zbMATH DE number 1001726 (Why is no real title available?)
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 1421254 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Incremental-like bundle methods with application to energy planning
- IQC analysis and synthesis via nonsmooth optimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
- Nonlinear optimization.
- Nonsmooth optimization for multiband frequency domain control design
- Nonsmooth optimization for multidisk \(H_\infty\) synthesis
- Optimization and nonsmooth analysis
- Second-order nonsmooth optimization for \(H_{\infty}\) synthesis
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Submonotone Subdifferentials of Lipschitz Functions
- The effect of deterministic noise in subgradient methods
- The Second-Order Subdifferential and the Dupin Indicatrices of a Non-Differentiable Convex Function
- Time domain constrained \(H_{\infty }\)-synthesis
Cited in
(32)- A bundle-Newton method for nonsmooth unconstrained minimization
- Bundle-type methods for inexact data
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- Outer approximation for mixed-integer nonlinear robust optimization
- Challenges in optimization with complex PDE-systems. Abstracts from the workshop held February 14--20, 2021 (hybrid meeting)
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- Boundary control of partial differential equations using frequency domain optimization techniques
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Rate of convergence of the bundle method
- scientific article; zbMATH DE number 1584097 (Why is no real title available?)
- Bundle method for nonconvex nonsmooth constrained optimization
- Nonconvex bundle method with application to a delamination problem
- Gradient set splitting in nonconvex nonsmooth numerical optimization
- scientific article; zbMATH DE number 4084884 (Why is no real title available?)
- Generalized Bundle Methods
- An inexact bundle method and subgradient computations for optimal control of deterministic and stochastic obstacle problems
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- A splitting bundle approach for non-smooth non-convex minimization
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- 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
- Minimizing oracle-structured composite functions
- Long term dynamics of the subgradient method for Lipschitz path differentiable functions
- A discussion of probability functions and constraints from a variational perspective
- A trust region method for the solution of the surrogate dual in integer programming
This page was built for publication: Bundle method for non-convex minimization with inexact subgradients and function values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746456)
