default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 180
Volume 180, Number 1, March 2020
- D. Russell Luke
, Marc Teboulle, Nguyen H. Thao:
Necessary conditions for linear convergence of iterated expansive, set-valued mappings. 1-31 - Tianyu Hao, Jong-Shi Pang:
Piecewise affine parameterized value-function based bilevel non-cooperative games. 33-73 - Nguyen Thi Van Hang, Boris S. Mordukhovich, M. Ebrahim Sarabi:
Second-order variational analysis in second-order cone programming. 75-116 - Mourad Baïou, Francisco Barahona:
Network strength games: the core and the nucleolus. 117-136 - Vassilis Apidopoulos, Jean-François Aujol, Charles Dossal:
Convergence rate of inertial Forward-Backward algorithm beyond Nesterov's rule. 137-156 - Evgeny Shindin, Gideon Weiss:
A simplex-type algorithm for continuous linear programs with constant coefficients. 157-201 - Roberto Andreani, Gabriel Haeser, Daiana S. Viana:
Optimality conditions and global convergence for nonlinear semidefinite programming. 203-235 - Guanghui Lan, Soomin Lee, Yi Zhou:
Communication-efficient algorithms for decentralized and stochastic optimization. 237-284 - Jan Kronqvist, David E. Bernal, Ignacio E. Grossmann:
Using regularization and second order information in outer approximation for convex MINLP. 285-310 - Michele Conforti, Marco Di Summa, Yuri Faenza:
Balas formulation for the union of polytopes is optimal. 311-326 - Edward J. Anderson, Huifu Xu, Dali Zhang:
Varying confidence levels for CVaR risk measures and minimax limits. 327-370 - Hui Zhang:
New analysis of linear convergence of gradient-type methods via unifying error bound conditions. 371-416 - Patrick R. Johnstone, Pierre Moulin:
Faster subgradient methods for functions with Hölderian growth. 417-450 - Clément W. Royer, Michael O'Neill, Stephen J. Wright:
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization. 451-488 - Yang Zheng, Giovanni Fantuzzi, Antonis Papachristodoulou, Paul Goulart, Andrew Wynn:
Chordal decomposition in operator-splitting methods for sparse semidefinite programs. 489-532
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-09 00:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
