Results 61 to 70 of about 182 (91)

The Convex Relaxation Method on Deconvolution Model withMultiplicative Noise

, 2013
Yu-Mei Huang, M. Ng, T. Zeng
semanticscholar   +1 more source

Sample Average Approximation with Sparsity-Inducing Penalty for High-Dimensional Stochastic Programming. [PDF]

Math Program, 2019
Liu H, Wang X, Yao T, Li R, Ye Y.
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

Optimality condition and iterative thresholding algorithm for [Formula: see text]-regularization problems. [PDF]

Springerplus, 2016
Jiao H, Chen Y, Yin J.
europepmc   +1 more source

Fast convergence of trust-regions for non-isolated minima via analysis of CG on indefinite matrices. [PDF]

Math Program
Rebjock Q, Boumal N.
europepmc   +1 more source

An efficient method for generalized linear multiplicative programming problem with multiplicative constraints. [PDF]

Springerplus, 2016
Zhao Y, Liu S.
europepmc   +1 more source

A DECOMPOSITION ALGORITHM FOR TWO-STAGE STOCHASTIC PROGRAMS WITH NONCONVEX RECOURSE FUNCTIONS. [PDF]

SIAM J Optim
Li H, Cui Y.
europepmc   +1 more source

A radial basis function method for noisy global optimisation. [PDF]

Math Program
Banholzer D, Fliege J, Werner R.
europepmc   +1 more source

A convergent relaxation of the Douglas-Rachford algorithm. [PDF]

Comput Optim Appl, 2018
Thao NH.
europepmc   +1 more source