Results 121 to 130 of about 173 (143)

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

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

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

Some of the next articles are maybe not open access.

Related searches:

A Riemannian Smoothing Steepest Descent Method for Non-Lipschitz Optimization on Embedded Submanifolds of Rn

Mathematics of Operations Research, 2023
Chao Zhang, Shiqian Ma, Xiaojun Chen
exaly  

Penalty and Augmented Lagrangian Methods for Constrained DC Programming

Mathematics of Operations Research, 2022
Zhe Sun, Zirui Zhou, Zhaosong Lu
exaly  

Stable Bounds on the Duality Gap of Separable Nonconvex Optimization Problems

Mathematics of Operations Research, 2023
Alexandre d'Aspremont
exaly  

Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem

Mathematics of Operations Research, 2022
Rujun Jiang, Xudong Li
exaly  

Distributed Stochastic Optimization With Large Delays

Mathematics of Operations Research, 2022
Nicholas Bambos, Zhengyuan Zhou, Peter W. Glynn   +2 more
exaly  

Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems

Mathematics of Operations Research, 2023
Shimrit Shtern, Shoham Sabach, Eyal Gur
exaly  

Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization

Mathematics of Operations Research, 2022
Yufeng Liu, Jong-shi Pang, Zhengling Qi
exaly