The regularized feasible directions method for nonconvex optimization
Year of publication: |
2022
|
---|---|
Authors: | Beck, Amir ; Hallak, Nadav |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 5, p. 517-523
|
Subject: | Constrained optimization | Convergence analysis | Feasible directions | Nonconvex optimization | Nonsmooth optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Minimizing piecewise-concave functions over polyhedra
Gaudioso, Manlio, (2018)
-
New diagonal bundle method for clustering problems in large data sets
Karmitsa, Napsu, (2017)
-
A gradient descent based algorithm for ℓp minimization
Jiang, Shan, (2020)
- More ...
-
On the minimization over sparse symmetric sets : projections, optimality conditions, and algorithms
Beck, Amir, (2016)
-
An adaptive Lagrangian-based scheme for nonconvex composite optimization
Hallak, Nadav, (2023)
-
A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization
Hallak, Nadav, (2019)
- More ...