Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
From MaRDI portal
Publication:3161149
DOI10.1080/10556780902842495zbMath1198.90359OpenAlexW1980223459WikidataQ109595716 ScholiaQ109595716MaRDI QIDQ3161149
Napsu Karmitsa, Marko M. Mäkelä
Publication date: 12 October 2010
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780902842495
Related Items (12)
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ On Lipschitz optimization based on gray-box piecewise linearization ⋮ An optimal subgradient algorithm for large-scale bound-constrained convex optimization ⋮ A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ Constrained nonconvex nonsmooth optimization via proximal bundle method ⋮ A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization ⋮ An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space ⋮ Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization ⋮ Finite convergence of an active signature method to local minima of piecewise linear functions ⋮ An algorithm for nonsmooth optimization by successive piecewise linearization ⋮ A splitting bundle approach for non-smooth non-convex minimization
Uses Software
This page was built for publication: Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
