Pages that link to "Item:Q2896073"

The following pages link to A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning (Q2896073):

Displaying 25 items.

• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
• OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
• Training Lp norm multiple kernel learning in the primal (Q461152) (← links)
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
• A note on computing the smallest conic singular value (Q1636761) (← links)
• On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory (Q1717808) (← links)
• Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
• An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
• An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems (Q2112678) (← links)
• A fast quasi-Newton method for semi-supervised SVM (Q2275982) (← links)
• Spectral projected subgradient method for nonsmooth convex optimization problems (Q2700023) (← links)
• Parallel Optimization Techniques for Machine Learning (Q3300501) (← links)
• (Q4558572) (← links)
• Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds (Q4609464) (← links)
• A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization (Q5076721) (← links)
• Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity (Q5231668) (← links)
• On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence (Q5235484) (← links)
• Adaptive FISTA for Nonconvex Optimization (Q5235485) (← links)
• IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems (Q5737721) (← links)
• An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising (Q5860376) (← links)
• An overview of stochastic quasi-Newton methods for large-scale machine learning (Q6097379) (← links)
• An anytime algorithm for constrained stochastic shortest path problems with deterministic policies (Q6098853) (← links)
• Minimizing oracle-structured composite functions (Q6173766) (← links)
• On the inversion-free Newton's method and its applications (Q6612368) (← links)
• AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems (Q6644996) (← links)