default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 207
Volume 207, Number 1, September 2024
- Zhuoqing Song, Lei Shi, Shi Pu, Ming Yan
:
Optimal gradient tracking for decentralized optimization. 1-53 - Liyuan Cao, Albert S. Berahas, Katya Scheinberg:
First- and second-order high probability complexity bounds for trust-region methods with noisy oracles. 55-106 - Yue Xie, Stephen J. Wright:
Complexity of a projected Newton-CG method for optimization with bounds. 107-144 - Damek Davis, Dmitriy Drusvyatskiy, Vasileios Charisopoulos:
Stochastic algorithms with geometric step decay converge linearly on sharp functions. 145-190 - Jean-Pierre Dussault, Tangi Migot, Dominique Orban:
Scalable adaptive cubic regularization methods. 191-225 - Haixiang Zhang, Baturalp Yalcin, Javad Lavaei, Somayeh Sojoudi:
A new complexity metric for nonconvex rank-one generalized matrix completion. 227-268 - Alberto Del Pia, Aida Khajavirad:
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs. 269-301 - Gergely Ambrus, Adrián Csiszárik, Máté Matolcsi, Dániel Varga, Pál Zsámboki:
The density of planar sets avoiding unit distances. 303-327 - Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang:
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k. 329-367 - Rohit Kannan, Güzin Bayraksan, James R. Luedtke:
Residuals-based distributionally robust optimization with covariate information. 369-425 - Yong Sheng Soh, Antonios Varvitsiotis:
Multiplicative updates for symmetric-cone factorizations. 427-456 - Yan Li, Guanghui Lan, Tuo Zhao:
Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity. 457-513 - Federica Cecchetto, Vera Traub, Rico Zenklusen:
Better-than-$\frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation. 515-549 - Cédric Josz, Lexiao Lai:
Global stability of first-order methods for coercive tame functions. 551-576 - Alex Dunbar, Saumya Sinha, Andrew J. Schaefer:
Relaxations and duality for multiobjective integer programming. 577-616 - Hananel Zaichyk, Armin Biess, Aryeh Kontorovich, Yury Makarychev:
Efficient Kirszbraun extension with applications to regression. 617-642 - Hananel Zaichyk, Armin Biess, Aryeh Kontorovich, Yury Makarychev:
Correction: Efficient Kirszbraun extension with applications to regression. 643 - Igor Klep, Victor Magron, Jurij Volcic, Jie Wang:
State polynomials: positivity, optimization and nonlinear Bell inequalities. 645-691 - Daniel Brosch, Sven C. Polak:
New lower bounds on crossing numbers of Km,n from semidefinite programming. 693-715 - Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu:
A polynomial time algorithm for finding a minimum 4-partition of a submodular function. 717-732 - Manru Zong, Yin Tat Lee, Man-Chung Yue:
Short-step methods are not strongly polynomial-time. 733-746
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 2024-09-14 23:53 CEST 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:
