Results 41 to 50 of about 106 (96)

Subgradient ellipsoid method for nonsmooth convex problems. [PDF]

Math Program, 2023
Rodomanov A, Nesterov Y.
europepmc   +1 more source

Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]

J Stat Theory Pract
Röttger F, Kahle T, Schwabe R.
europepmc   +1 more source

A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique. [PDF]

Comput Optim Appl
Karapetyants MA.
europepmc   +1 more source

Variable Smoothing for Convex Optimization Problems Using Stochastic Gradients. [PDF]

J Sci Comput, 2020
Boţ RI, Böhm A.
europepmc   +1 more source

A first order method for linear programming parameterized by circuit imbalance. [PDF]

Math Program
Cole R, Hertrich C, Tao Y, Végh LA.
europepmc   +1 more source

An incremental mirror descent subgradient algorithm with random sweeping and proximal step. [PDF]

Optimization, 2019
Boţ RI, Böhm A.
europepmc   +1 more source

NOISY MATRIX COMPLETION: UNDERSTANDING STATISTICAL GUARANTEES FOR CONVEX RELAXATION VIA NONCONVEX OPTIMIZATION. [PDF]

SIAM J Optim, 2020
Chen Y, Chi Y, Fan J, Ma C, Yan Y.
europepmc   +1 more source

High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. [PDF]

Math Program
Ahookhosh M, Nesterov Y.
europepmc   +1 more source

A family of conjugate gradient methods for large-scale nonlinear equations. [PDF]

J Inequal Appl, 2017
Feng D, Sun M, Wang X.
europepmc   +1 more source

Gradient regularization of Newton method with Bregman distances. [PDF]

Math Program
Doikov N, Nesterov Y.
europepmc   +1 more source