Pages that link to "Item:Q1694392"

The following pages link to On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392):

Displaying 12 items.

• A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
• Conditional gradient method for multiobjective optimization (Q2028470) (← links)
• Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations (Q2052297) (← links)
• On the inexact scaled gradient projection method (Q2070333) (← links)
• On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches (Q2084591) (← links)
• First-order methods for the convex hull membership problem (Q2106714) (← 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 cubic regularization of Newton's method with finite difference Hessian approximations (Q2138398) (← links)
• Subsampled nonmonotone spectral gradient methods (Q2178981) (← links)
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545) (← links)
• A subgradient method with non-monotone line search (Q2696908) (← links)
• Quadratic regularization methods with finite-difference gradient approximations (Q6175465) (← links)