Results 91 to 100 of about 151 (140)

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

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

On Homogeneous Convex Cones, Carathéodory Number, And Duality Mapping

, 1999
Using three simple examples, we answer three questions related to homogeneous convex cones, the Carath'eodory number of convex cones and self-concordant barriers for convex cones.
Song Xu, Levent Tunçel
core  

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

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

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

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

Extragradient subgradient methods for solving bilevel equilibrium problems. [PDF]

J Inequal Appl, 2018
Yuying T, Dinh BV, Kim DS, Plubtieng S.
europepmc   +1 more source

An existence-uniqueness theorem and alternating contraction projection methods for inverse variational inequalities. [PDF]

J Inequal Appl, 2018
He S, Dong QL.
europepmc   +1 more source

On compositions of special cases of Lipschitz continuous operators. [PDF]

Fixed Point Theory Algorithm Sci Eng, 2021
Giselsson P, Moursi WM.
europepmc   +1 more source

A double projection algorithm for quasimonotone variational inequalities in Banach spaces. [PDF]

J Inequal Appl, 2018
Zheng L.
europepmc   +1 more source

Automated tight Lyapunov analysis for first-order methods. [PDF]

Math Program
Upadhyaya M, Banert S, Taylor AB, Giselsson P.   +3 more
europepmc   +1 more source