Pages that link to "Item:Q1717575"
From MaRDI portal
The following pages link to An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575):
Displayed 13 items.
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information (Q2031374) (← links)
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
- A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems (Q2694519) (← links)
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)
- Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)