A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
From MaRDI portal
Publication:5883328
Recommendations
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- A new nonsmooth trust-region method equipped with a line search for minimizing locally Lipschitz functions
- A trust region method for solving linearly constrained locally Lipschitz optimization problems
- scientific article; zbMATH DE number 4076973
Cites work
- scientific article; zbMATH DE number 3868525 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3619635 (Why is no real title available?)
- scientific article; zbMATH DE number 4119948 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A Linearization Algorithm for Nonsmooth Minimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A bundle-Newton method for nonsmooth unconstrained minimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- A model algorithm for composite nondifferentiable optimization problems
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A new trust region method for nonsmooth nonconvex optimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- A redistributed proximal bundle method for nonconvex optimization
- A trust region algorithm for minimization of locally Lipschitzian functions
- Aggregate subgradient method for nonsmooth DC optimization
- An augmented subgradient method for minimizing nonsmooth DC functions
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- Approximate convexity and submonotonicity.
- Benchmarking optimization software with performance profiles.
- Bundle method for nonconvex nonsmooth constrained optimization
- Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- Cutting plane oracles to minimize non-smooth non-convex functions
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Introduction to nonsmooth optimization. Theory, practice and software
- Level bundle methods for oracles with on-demand accuracy
- Non-smooth optimization for robust control of infinite-dimensional systems
- Nonconvex bundle method with application to a delamination problem
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Nonsmooth optimization via quasi-Newton methods
- Optimization and nonsmooth analysis
- Proximal Methods in Vector Optimization
- Proximal bundle methods for nonsmooth DC programming
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Subgradient method for nonconvex nonsmooth optimization
- Submonotone Subdifferentials of Lipschitz Functions
- Trust Region Methods
Cited in
(4)- Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm
- A trust region algorithm for minimization of locally Lipschitzian functions
- A version of bundle trust region method with linear programming
- A new nonsmooth trust-region method equipped with a line search for minimizing locally Lipschitz functions
This page was built for publication: A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883328)
