default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 204
Volume 204, Number 1, March 2024
- Nikita Doikov
, Yurii E. Nesterov:
Gradient regularization of Newton method with Bregman distances. 1-25 - Yuni Iwamasa:
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 ˟ 2 submatrices. 27-79 - Bertrand Guenin, Cheolwon Heo:
Small separations in pinch-graphic matroids. 81-111 - Bertrand Guenin, Cheolwon Heo:
Recognizing pinch-graphic matroids. 113-134 - Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh:
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. 135-206 - Azam Asl, Haihao Lu, Jinwen Yang:
A J-symmetric quasi-newton method for minimax problems. 207-254 - Digvijay Boob, Cristóbal Guzmán:
Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems. 255-297 - Tianyun Tang, Kim-Chuan Toh:
Solving graph equipartition SDPs on an algebraic variety. 299-347 - Tongseok Lim:
Geometry of vectorial martingale optimal transportations and duality. 349-383 - Bochuan Lyu, Illya V. Hicks, Joey Huchette:
Modeling combinatorial disjunctive constraints via junction trees. 385-413 - Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse collections in matroids and graphs. 415-447 - Jean-François Aujol, Charles Dossal, Aude Rondepierre:
FISTA is an automatic geometrically optimized algorithm for strongly convex functions. 449-491 - Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
Approximation algorithms for flexible graph connectivity. 493-516 - Ziyu He, Shaoning Han, Andrés Gómez, Ying Cui, Jong-Shi Pang:
Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix. 517-566 - Shuvomoy Das Gupta, Bart P. G. Van Parys, Ernest K. Ryu:
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods. 567-639 - Shuvomoy Das Gupta, Bart P. G. Van Parys, Ernest K. Ryu:
Publisher Correction: Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods. 641 - Norihide Tokushige:
The maximum measure of non-trivial 3-wise intersecting families. 643-676 - Timm Oertel, Joseph Paat, Robert Weismantel:
A colorful Steinitz Lemma with application to block-structured integer programs. 677-702 - Linchuan Wei, Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz:
On the convex hull of convex quadratic optimization problems with indicators. 703-737 - Ilias Zadik, Miles Lubin, Juan Pablo Vielma:
Shapes and recession cones in mixed-integer convex representability. 739-752 - Bruno F. Lourenço, Vera Roshchina, James Saunderson:
Hyperbolicity cones are amenable. 753-764
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-12-19 22:15 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:
