The following pages link to Yu. E. Nesterov (Q327227):
Displaying 50 items.
- Primal-dual subgradient methods for convex problems (Q116219) (← links)
- (Q299413) (redirect page) (← links)
- Finding the stationary states of Markov chains by iterative methods (Q299414) (← links)
- Efficient numerical methods for entropy-linear programming problems (Q327229) (← links)
- (Q403633) (redirect page) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- (Q490544) (redirect page) (← links)
- Nearest stable system using successive convex approximations (Q490545) (← links)
- Primal-dual methods for solving infinite-dimensional games (Q493268) (← links)
- Barrier subgradient method (Q633113) (← links)
- Solving strongly monotone variational and quasi-variational inequalities (Q653902) (← links)
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← links)
- Lectures on convex optimization (Q723525) (← links)
- Dual extrapolation and its applications to solving variational inequalities and related problems (Q868471) (← links)
- Smoothing technique and its applications in semidefinite optimization (Q879964) (← links)
- A gradient-type algorithm optimizing the coupling between matrices (Q935392) (← links)
- (Q1029544) (redirect page) (← links)
- Primal central paths and Riemannian distances for convex sets (Q1029546) (← links)
- Introductory lectures on convex optimization. A basic course. (Q1417731) (← links)
- Augmented self-concordant barriers and nonlinear optimization problems with finite complexity (Q1424292) (← links)
- (Q1572674) (redirect page) (← links)
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems (Q1572675) (← links)
- (Q1586414) (redirect page) (← links)
- Stable traffic equilibria: Properties and applications (Q1586415) (← links)
- Computation of Fisher-Gale equilibrium by auction (Q1656189) (← links)
- Universal method for stochastic composite optimization problems (Q1746349) (← links)
- Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks (Q1757624) (← links)
- On the accuracy of the ellipsoid norm approximation of the joint spectral radius (Q1765889) (← links)
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods. (Q1865823) (← links)
- New variants of bundle methods (Q1922693) (← links)
- An interior-point method for generalized linear-fractional programming (Q1922695) (← links)
- On the quality of first-order approximation of functions with Hölder continuous gradient (Q1985266) (← links)
- Computation of the analytic center of the solution set of the linear matrix inequality arising in continuous- and discrete-time passivity analysis (Q2022374) (← links)
- New results on superlinear convergence of classical quasi-Newton methods (Q2031938) (← links)
- Minimizing uniformly convex functions by cubic regularization of Newton method (Q2032037) (← links)
- Local convergence of tensor methods (Q2133417) (← links)
- Rates of superlinear convergence for classical quasi-Newton methods (Q2149549) (← links)
- Soft clustering by convex electoral model (Q2156895) (← links)
- Smoothness parameter of power of Euclidean norm (Q2178876) (← links)
- Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems (Q2313241) (← links)
- On the efficiency of a randomized mirror descent algorithm in online optimization problems (Q2354481) (← links)
- Distributed price adjustment based on convex analysis (Q2359783) (← links)
- Random gradient-free minimization of convex functions (Q2397749) (← links)
- Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
- Linear convergence of first order methods for non-strongly convex optimization (Q2414900) (← links)
- Confidence level solutions for stochastic programming (Q2440765) (← links)
- Cubic regularization of Newton method and its global performance (Q2494519) (← links)
- Positivity and linear matrix inequalities (Q2512225) (← links)
- Superfast second-order methods for unconstrained convex optimization (Q2664892) (← links)
