Pages that link to "Item:Q2934484"
From MaRDI portal
The following pages link to Proximal Newton-Type Methods for Minimizing Composite Functions (Q2934484):
Displaying 50 items.
- A Barzilai-Borwein type method for minimizing composite functions (Q494671) (← links)
- Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
- Fisher information regularization schemes for Wasserstein gradient flows (Q781954) (← links)
- Distributed block-diagonal approximation methods for regularized empirical risk minimization (Q782443) (← links)
- A proximal-based deomposition method for compositions method for convex minimization problems (Q1330895) (← links)
- A flexible coordinate descent method (Q1639710) (← links)
- A regularized semi-smooth Newton method with projection steps for composite convex programs (Q1668726) (← links)
- A fractal shape optimization problem in branched transport (Q1726952) (← links)
- Sub-sampled Newton methods (Q1739039) (← 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)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
- Analysis of continuous \(H^{-1}\)-least-squares methods for the steady Navier-Stokes system (Q2019998) (← links)
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
- Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
- Subspace quadratic regularization method for group sparse multinomial logistic regression (Q2044487) (← links)
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization (Q2082285) (← links)
- Computation for latent variable model estimation: a unified stochastic proximal framework (Q2103576) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss (Q2129205) (← links)
- Local convergence of tensor methods (Q2133417) (← links)
- Scalable proximal methods for cause-specific hazard modeling with time-varying coefficients (Q2134154) (← links)
- Second order semi-smooth proximal Newton methods in Hilbert spaces (Q2141359) (← links)
- A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization (Q2149551) (← links)
- Hessian informed mirror descent (Q2162317) (← links)
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising (Q2175442) (← links)
- Separating variables to accelerate non-convex regularized optimization (Q2181546) (← links)
- Optimal rates for estimation of two-dimensional totally positive distributions (Q2192313) (← links)
- Testing and non-linear preconditioning of the proximal point method (Q2198162) (← links)
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions (Q2200083) (← links)
- Finite-sample analysis of \(M\)-estimators using self-concordance (Q2219231) (← links)
- Regularized estimation for highly multivariate log Gaussian Cox processes (Q2302515) (← links)
- Generalized self-concordant functions: a recipe for Newton-type methods (Q2330645) (← links)
- Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
- A proximal iteratively regularized Gauss-Newton method for nonlinear inverse problems (Q2397872) (← links)
- Inexact successive quadratic approximation for regularized optimization (Q2419525) (← links)
- Empirical risk minimization: probabilistic complexity and stepsize strategy (Q2419551) (← links)
- An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
- A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
- A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula (Q2691372) (← links)
- A second-order method for convex<sub>1</sub>-regularized optimization with active-set prediction (Q2815550) (← links)
- A multilevel framework for sparse optimization with application to inverse covariance estimation and logistic regression (Q2830631) (← links)
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization (Q3176355) (← links)
- An Improved Fast Iterative Shrinkage Thresholding Algorithm for Image Deblurring (Q3192670) (← links)
- Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms (Q4586171) (← links)
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems (Q4606653) (← links)
- Projected Dynamical Systems on Irregular, Non-Euclidean Domains for Nonlinear Optimization (Q4965188) (← links)
- An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems (Q4999369) (← links)
