Bundle trust region algorithm based on linear subproblem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3619635 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (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 Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- A Linearization Algorithm for Nonsmooth Minimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A descent method with linear programming subproblems for nondifferentiable convex optimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A new trust region method for nonsmooth nonconvex optimization
- A proximal bundle algorithm for nonsmooth optimization on Riemannian manifolds
- A proximal bundle method based on approximate subgradients
- 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 simple version of bundle method with linear programming
- A trust region algorithm for minimization of locally Lipschitzian functions
- A version of bundle trust region method with linear programming
- 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
- Benchmarking optimization software with performance profiles.
- Bundle method for nonconvex nonsmooth constrained optimization
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- 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
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Decomposition algorithms for stochastic programming on a computational grid
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Introduction to nonsmooth optimization. Theory, practice and software
- Level bundle methods for oracles with on-demand accuracy
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- Non-smooth optimization for robust control of infinite-dimensional systems
- Nonconvex bundle method with application to a delamination problem
- Nonlinear optimization.
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Nonsmooth optimization via quasi-Newton methods
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Piecewise-quadratic approximations in convex numerical optimization
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Subgradient method for nonconvex nonsmooth optimization
- Submonotone Subdifferentials of Lipschitz Functions
- Variational Analysis
This page was built for publication: Bundle trust region algorithm based on linear subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983493)