Pages that link to "Item:Q2129642"
From MaRDI portal
The following pages link to A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642):
Displaying 10 items.
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542) (← links)
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities (Q1922692) (← links)
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
- A stochastic approximation method for convex programming with many semidefinite constraints (Q5882223) (← links)
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)
