Pages that link to "Item:Q2419525"
From MaRDI portal
The following pages link to Inexact successive quadratic approximation for regularized optimization (Q2419525):
Displaying 28 items.
- An inexact successive quadratic approximation method for L-1 regularized optimization (Q301652) (← links)
- Practical inexact proximal quasi-Newton method with global complexity analysis (Q344963) (← links)
- Distributed block-diagonal approximation methods for regularized empirical risk minimization (Q782443) (← links)
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates (Q1744900) (← links)
- Inexact variable metric stochastic block-coordinate descent for regularized optimization (Q1985280) (← links)
- Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- Second order semi-smooth proximal Newton methods in Hilbert spaces (Q2141359) (← links)
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions (Q2200083) (← links)
- New convergence results for the inexact variable metric forward-backward method (Q2662557) (← links)
- A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
- Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope (Q5131965) (← links)
- Inexact proximal stochastic second-order methods for nonconvex composite optimization (Q5135256) (← links)
- (Q5148989) (← links)
- On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization (Q6042933) (← links)
- Inexact proximal DC Newton-type method for nonconvex composite functions (Q6155059) (← links)
- Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
- Minimizing oracle-structured composite functions (Q6173766) (← links)
- Inexact proximal Newton methods in Hilbert spaces (Q6179871) (← links)
- Analysis of a variable metric block coordinate method under proximal errors (Q6195234) (← links)
- A new proximal heavy ball inexact line-search algorithm (Q6541375) (← links)
- A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping (Q6639509) (← links)
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ <sub>1</sub> -regularized problems (Q6640996) (← links)
- A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity (Q6641006) (← links)
- An inexact regularized proximal Newton method without line search (Q6642786) (← links)
- On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces (Q6648843) (← links)
- A proximal stochastic quasi-Newton algorithm with dynamical sampling and stochastic line search (Q6655883) (← links)