Composite proximal bundle method
From MaRDI portal
Publication:359623
DOI10.1007/S10107-012-0600-5zbMATH Open1273.90163OpenAlexW2035198055MaRDI QIDQ359623FDOQ359623
Authors: Claudia Sagastizábal 
Publication date: 12 August 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0600-5
Recommendations
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- A proximal method for composite minimization
- A doubly stabilized bundle method for nonsmooth convex optimization
- On a Class of Nonsmooth Composite Functions
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Numerical methods based on necessary conditions (49M05)
Cites Work
- New limited memory bundle method for large-scale nonsmooth optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Title not available (Why is that?)
- Convergence of some algorithms for convex minimization
- Title not available (Why is that?)
- Comparing different nonsmooth minimization methods and software
- A redistributed proximal bundle method for nonconvex optimization
- A proximity control algorithm to minimize nonsmooth and nonconvex functions
- Semismooth and Semiconvex Functions in Constrained Optimization
- Title not available (Why is that?)
- A proximal method for composite minimization
- Title not available (Why is that?)
- Nonsmooth optimization via quasi-Newton methods
- A Gauss-Newton method for convex composite optimization
- On convergence of the Gauss-Newton method for convex composite optimization.
- Incremental-like bundle methods with application to energy planning
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- A \(\mathcal{VU}\)-algorithm for convex minimization
- The 𝒰-Lagrangian of a convex function
- Active Sets, Nonsmoothness, and Sensitivity
- On a Class of Nonsmooth Composite Functions
- Local properties of algorithms for minimizing nonsmooth composite functions
- Two numerical methods for optimizing matrix stability
- On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
- Identifying structure of nonsmooth convex functions by the bundle technique
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- A second-order bundle method to minimize the maximum eigenvalue function.
Cited In (27)
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- A doubly stabilized bundle method for nonsmooth convex optimization
- A proximal method for composite minimization
- Nonsmooth optimization via quasi-Newton methods
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Incremental bundle methods using upper models
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Harnessing Structure in Composite Nonsmooth Minimization
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Title not available (Why is that?)
- Computing proximal points of convex functions with inexact subgradients
- On a Class of Nonsmooth Composite Functions
- Non-smooth optimization for robust control of infinite-dimensional systems
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
- Nonsmooth optimization method for \(H_\infty\) output feedback control
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Bundle method for non-convex minimization with inexact subgradients and function values
- The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- The multiproximal linearization method for convex composite problems
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
Uses Software
This page was built for publication: Composite proximal bundle method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359623)
