Pages that link to "Item:Q1356053"
From MaRDI portal
The following pages link to A preconditioning proximal Newton method for nondifferentiable convex optimization (Q1356053):
Displaying 12 items.
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- An approximate quasi-Newton bundle-type method for nonsmooth optimization (Q370139) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
- Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
- Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions (Q2200083) (← links)
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems (Q2307749) (← links)
- A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
- Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs (Q2797758) (← links)
- The indefinite proximal point algorithms for maximal monotone operators (Q5009166) (← links)
