default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 208
Volume 208, Number 1, November 2024
- Yongchun Li, Weijun Xie
:
Beyond symmetry: best submatrix selection for the sparse truncated SVD. 1-50 - Lai Tian, Anthony Man-Cho So:
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians. 51-74 - Brendan Pass, Adolfo Vargas-Jiménez:
A general framework for multi-marginal optimal transport. 75-110 - Alon Rieger, Danny Segev:
Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings. 111-171 - Jiaming Liang, Vincent Guigues, Renato D. C. Monteiro:
A single cut proximal bundle method for stochastic convex composite optimization. 173-208 - Volker Krätschmer:
First order asymptotics of the sample average approximation method to solve risk averse stochastic programs. 209-242 - Moslem Zamani, Hadi Abbaszadehpeivasti, Etienne de Klerk:
The exact worst-case convergence rate of the alternating direction method of multipliers. 243-276 - Majid Farhadi, Swati Gupta, Shengding Sun, Prasad Tetali, Michael C. Wigal:
Hardness and approximation of submodular minimum linear ordering problems. 277-318 - Jelena Diakonikolas, Cristóbal Guzmán:
Complementary composite minimization, small gradients in general norms, and applications. 319-363 - Masoud Ahookhosh, Yurii E. Nesterov:
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. 365-407 - Masoud Ahookhosh, Yurii E. Nesterov:
Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. 409-410 - Charles Audet, Pierre-Yves Bouchet, Loïc Bourdin:
Counterexample and an additional revealing poll step for a result of "analysis of direct searches for discontinuous functions". 411-424 - Quang Minh Bui, Margarida Carvalho, José Neto:
Asymmetry in the complexity of the multi-commodity network pricing problem. 425-461 - Hua Chen, Lin Chen, Guochuan Zhang:
FPT algorithms for a special block-structured integer program with applications in scheduling. 463-496 - Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková, Felix Schröder:
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. 497-531 - Soroosh Shafiee, Fatma Kilinç-Karzan:
Constrained optimization of rank-one functions with indicator variables. 533-579 - Ningji Wei, Peter Yun Zhang:
Adjustability in robust linear optimization. 581-628 - Michelangelo Bin, Ivano Notarnicola, Thomas Parisini:
Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization. 629-660 - Simon Thomä, Grit Walther, Maximilian Schiffer:
Designing tractable piecewise affine policies for multi-stage adjustable robust optimization. 661-716 - Liaoyuan Zeng, Yongle Zhang, Guoyin Li, Ting Kei Pong, Xiaozhou Wang:
Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems. 717-761 - Christoph Hunkenschröder:
Deciding whether a lattice has an orthonormal basis is in co-NP. 763-775
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-06-24 21:22 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:
