Search Results - subject:"Nonsmooth optimization"

The cost of nonconvexity in deterministic nonsmooth optimization

Kong, Siyu; Lewis, Adrian S. - In: Mathematics of operations research 49 (2024) 4, pp. 2385-2401

Persistent link: https://www.econbiz.de/10015197933

Newton-type methods with the proximal gradient step for sparse estimation

Shimmura, Ryosuke; Suzuki, Joe - In: Operations research forum 5 (2024) 2, pp. 1-27

Persistent link: https://www.econbiz.de/10015179744

A first-order primal-dual method for nonconvex constrained optimization based on the augmented Lagrangian

Zhu, Daoli; Zhao, Lei; Zhang, Shuzhong - In: Mathematics of operations research 49 (2024) 1, pp. 125-150

Persistent link: https://www.econbiz.de/10014527298

An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization

Maleknia, Morteza; Soleimani-Damaneh, Majid - In: European journal of operational research : EJOR 319 (2024) 2, pp. 505-516

Persistent link: https://www.econbiz.de/10015084854

Stochastic subgradient descent escapes active strict saddles on weakly convex functions

Bianchi, Pascal; Hachem, Walid; Schechtman, Sholom - In: Mathematics of operations research 49 (2024) 3, pp. 1761-1790

Persistent link: https://www.econbiz.de/10015047790

The descent-ascent algorithm for DC programming

D’Alessandro, Pietro; Gaudioso, Manlio; Giallombardo, … - In: INFORMS journal on computing : JOC ; charting new … 36 (2024) 2, pp. 657-671

Persistent link: https://www.econbiz.de/10014532317

A proximal quasi-Newton trust-region method for nonsmooth regularized optimization

Aravkin, Aleksandr; Baraldi, Robert; Orban, Dominique - 2021

Persistent link: https://www.econbiz.de/10012588124

Optimization methods for fully composite problems

Doikov, Nikita; Nesterov, Jurij Evgenʹevič - 2021

Persistent link: https://www.econbiz.de/10012512893

A novel optimization approach towards improving separability of clusters

Bagirov, Adil; Hoseini-Monjezi, Najmeh; Taheri, Sona - In: Computers & operations research : and their … 152 (2023), pp. 1-13

Persistent link: https://www.econbiz.de/10014266476

On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm

Serrano, Felipe; Schwarz, Robert; Gleixner, Ambros - In: Journal of Global Optimization 78 (2020) 1, pp. 161-179

Recently, Kronqvist et al. (J Global Optim 64(2):249–272, 2016) rediscovered the supporting hyperplane algorithm of Veinott (Oper Res 15(1):147–152, 1967) and demonstrated its computational benefits for solving convex mixed integer nonlinear programs. In this paper we derive the algorithm...

Persistent link: https://www.econbiz.de/10014504380