Subgradient ellipsoid method for nonsmooth convex problems. [PDF]
Rodomanov A, Nesterov Y.
europepmc +1 more source
Reweighted `1-minimization for sparse solutions to underdetermined linear systems
. Numerical experiments have indicated that the reweighted `1-minimization performs exceptionally well in locating sparse solutions of underdetermined linear systems of equations.
Yun-bin Zhao, Duan Li
core
Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]
Röttger F, Kahle T, Schwabe R.
europepmc +1 more source
Variable Smoothing for Convex Optimization Problems Using Stochastic Gradients. [PDF]
Boţ RI, Böhm A.
europepmc +1 more source
A first order method for linear programming parameterized by circuit imbalance. [PDF]
Cole R, Hertrich C, Tao Y, Végh LA.
europepmc +1 more source
Modified Projection-Type Methods For Monotone Variational Inequalities
. We propose new methods for solving the variational inequality problem where the underlying function F is monotone. These methods may be viewed as projection-type methods in which the projection direction is modified by a strongly monotone mapping of ...
Michael V. Solodov, Paul Tseng
core
A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique. [PDF]
Karapetyants MA.
europepmc +1 more source
Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems. [PDF]
Wang X.
europepmc +1 more source
A family of conjugate gradient methods for large-scale nonlinear equations. [PDF]
Feng D, Sun M, Wang X.
europepmc +1 more source
A Generalization Of Young's l p Inequality
. We show that, for positive real numbers with a 1+ P N i ff i , the function r a a Q N i=1 x ff i i has a convex conjugate of the same form and so, in particular, obtain a clean proof that f is convex. AMS (1991) subject classification: Primary
Jonathan M. Borwein
core

