AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Spectral projected gradient method for stochastic optimization
Gradient methods with adaptive step-sizes
An adaptive Monte Carlo algorithm for computing mixed logit estimators
New adaptive stepsize selections in gradient methods
A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
Variable sample size method for equality constrained optimization problems
An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems
Subsampled nonmonotone spectral gradient methods
Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation
Nonmonotone line search methods with variable sample size
Convergence analysis for the modified spectral projected subgradient method
On the steplength selection in gradient methods for unconstrained optimization
Spectral projected subgradient method for nonsmooth convex optimization problems
Inexact restoration approach for minimization with inexact evaluation of the objective function
Convex optimization: algorithms and complexity
A quasi-Newton approach to nonsmooth convex optimization problems in machine learning
Hybrid deterministic-stochastic methods for data fitting
Descent direction method with line search for unconstrained optimization in noisy environment
Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
Two-Point Step Size Gradient Methods
A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
Variable-sample methods for stochastic optimization
Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities
A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
A Nonmonotone Line Search Technique for Newton’s Method
A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization
Lectures on Stochastic Programming: Modeling and Theory, Third Edition
Stochastic Optimization Methods
A Stochastic Line Search Method with Expected Complexity Analysis
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
Subsampled inexact Newton methods for minimizing large sums of convex functions
LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums

This page was built for publication: AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644996)