Results 61 to 67 of about 68 (67)
The q-G method : A q-version of the Steepest Descent method for global optimization. [PDF]
Springerplus, 2015 Soterroni AC +3 more
europepmc +1 more source
A range division and contraction approach for nonconvex quadratic program with quadratic constraints. [PDF]
Springerplus, 2016 Xue C, Jiao H, Yin J, Chen Y.
europepmc +1 more source
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. [PDF]
Math Program, 2018 Gribling S, de Laat D, Laurent M.
europepmc +1 more source
Global optimization in Hilbert space. [PDF]
Math Program, 2019 Houska B, Chachuat B.
europepmc +1 more source
Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. [PDF]
Math Program, 2017 Liu H, Yao T, Li R, Ye Y.
europepmc +1 more source
An SQP method for mathematical programs with vanishing constraints with strong convergence properties. [PDF]
Comput Optim Appl, 2017 Benko M, Gfrerer H.
europepmc +1 more source
OPTIMAL COMPUTATIONAL AND STATISTICAL RATES OF CONVERGENCE FOR SPARSE NONCONVEX LEARNING PROBLEMS. [PDF]
Ann Stat, 2014 Wang Z, Liu H, Zhang T.
europepmc +1 more source