4.6 Article

Global convergence rate analysis of unconstrained optimization methods based on probabilistic models

Related references

Note: Only part of the references are listed.
Article Mathematics, Applied

DIRECT SEARCH BASED ON PROBABILISTIC DESCENT

S. Gratton et al.

SIAM JOURNAL ON OPTIMIZATION (2015)

Article Computer Science, Software Engineering

First-order methods of smooth convex optimization with inexact oracle

Olivier Devolder et al.

MATHEMATICAL PROGRAMMING (2014)

Article Mathematics, Applied

CONVERGENCE OF TRUST-REGION METHODS BASED ON PROBABILISTIC MODELS

A. S. Bandeira et al.

SIAM JOURNAL ON OPTIMIZATION (2014)

Article Mathematics, Applied

STOCHASTIC FIRST- AND ZEROTH-ORDER METHODS FOR NONCONVEX STOCHASTIC PROGRAMMING

Saeed Ghadimi et al.

SIAM JOURNAL ON OPTIMIZATION (2013)

Article Computer Science, Software Engineering

Sample size selection in optimization methods for machine learning

Richard H. Byrd et al.

MATHEMATICAL PROGRAMMING (2012)

Article Mathematics, Applied

ON THE ORACLE COMPLEXITY OF FIRST-ORDER AND DERIVATIVE-FREE ALGORITHMS FOR SMOOTH NONCONVEX MINIMIZATION

Coralia Cartis et al.

SIAM JOURNAL ON OPTIMIZATION (2012)

Article Computer Science, Software Engineering

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results

Coralia Cartis et al.

MATHEMATICAL PROGRAMMING (2011)

Article Computer Science, Software Engineering

Cubic regularization of Newton method and its global performance

Yurii Nesterov et al.

MATHEMATICAL PROGRAMMING (2006)