Results 121 to 130 of about 162 (141)
An SQP method for mathematical programs with vanishing constraints with strong convergence properties. [PDF]
Benko M, Gfrerer H.
europepmc +1 more source
OPTIMAL COMPUTATIONAL AND STATISTICAL RATES OF CONVERGENCE FOR SPARSE NONCONVEX LEARNING PROBLEMS. [PDF]
Wang Z, Liu H, Zhang T.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ADMM for multiaffine constrained optimization
Optimization Methods and Software, 2020Frank E Curtis +2 more
exaly
GloptiPoly 3: moments, optimization and semidefinite programming
Optimization Methods and Software, 2009Didier Henrion +2 more
exaly
Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
Optimization Methods and Software, 2019Wim van Ackooij, W de Oliveira
exaly
Branching and bounds tighteningtechniques for non-convex MINLP
Optimization Methods and Software, 2009Pietro Belotti, Jon Lee, Leo Liberti
exaly
Existence results for nonconvex equilibrium problems
Optimization Methods and Software, 2010Massimo Pappalardo +2 more
exaly
New Results on Quadratic Minimization
SIAM Journal on Optimization, 2003Shuzhong Zhang, Yinyu Ye
exaly
Abstract convexity for nonconvex optimization duality
Optimization, 2007Asuman E Ozdaglar, A Nedic, A Rubinov
exaly

