On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
Autor: | Nadav Hallak, Amir Beck |
---|---|
Rok vydání: | 2020 |
Předmět: |
021103 operations research
Mathematics::Optimization and Control 0211 other engineering and technologies Regular polygon Randomized methods 010103 numerical & computational mathematics 02 engineering and technology Function (mathematics) 01 natural sciences Stationary point Statistics::Computation Theoretical Computer Science Statistics::Machine Learning Convergence (routing) Applied mathematics 0101 mathematics Software Descent (mathematics) Mathematics |
Zdroj: | SIAM Journal on Optimization. 30:56-79 |
ISSN: | 1095-7189 1052-6234 |
Popis: | This paper studies the class of nonsmooth nonconvex problems in which the difference between a continuously differentiable function and a convex nonsmooth function is minimized over linear constrai... |
Databáze: | OpenAIRE |
Externí odkaz: |