Results 71 to 80 of about 1,196 (89)

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

Smoothing sample average approximation method for solving stochastic second-order-cone complementarity problems. [PDF]

J Inequal Appl, 2018
Luo M, Zhang Y.
europepmc   +1 more source

Analytic center cutting plane methods for variational inequalities over convex bodies. [PDF]

J Inequal Appl, 2018
Zeng R.
europepmc   +1 more source

The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints. [PDF]

J Optim Theory Appl, 2019
Bitterlich S, Boţ RI, Csetnek ER, Wanka G.   +3 more
europepmc   +1 more source

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. [PDF]

Math Program
Gaar E, Lee J, Ljubić I, Sinnl M, Tanınmış K.   +4 more
europepmc   +1 more source

Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem. [PDF]

Entropy (Basel), 2019
Guo CH, Guo Y, Liu BB.
europepmc   +1 more source

An Inertial Proximal-Gradient Penalization Scheme for Constrained Convex Optimization Problems. [PDF]

Vietnam J Math, 2018
Boţ RI, Csetnek ER, Nimana N.
europepmc   +1 more source

Second Order Splitting Dynamics with Vanishing Damping for Additively Structured Monotone Inclusions. [PDF]

J Dyn Differ Equ
Boţ RI, Hulett DA.
europepmc   +1 more source

A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints. [PDF]

J Inequal Appl, 2017
Ma G, Zhang Y, Liu M.
europepmc   +1 more source

A general double-proximal gradient algorithm for d.c. programming. [PDF]

Math Program, 2019
Banert S, Boț RI.
europepmc   +1 more source