Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
From MaRDI portal
Recommendations
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- New limited memory bundle method for large-scale nonsmooth optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
Cites work
- A constraint linearization method for nondifferentiable convex minimization
- A Limited Memory Algorithm for Bound Constrained Optimization
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An active set method for solving linearly constrained nonsmooth optimization problems
- Benchmarking optimization software with performance profiles.
- Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities
- Comparison of formulations and solution methods for image restoration problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- New limited memory bundle method for large-scale nonsmooth optimization
- Non-Euclidean restricted memory level method for large-scale convex optimization
- On the limited memory BFGS method for large scale optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Some numerical experiments with variable-storage quasi-Newton algorithms
Cited in
(11)- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Diagonal bundle method for nonsmooth sparse optimization
- A splitting bundle approach for non-smooth non-convex minimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
This page was built for publication: Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2786335)
