default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 214
Volume 214, Number 1, November 2025
- Courtney Paquette
, Elliot Paquette, Ben Adlam, Jeffrey Pennington:
Homogenization of SGD in high-dimensions: exact dynamics and generalization properties. 1-90 - Tianyun Tang, Kim-Chuan Toh:
Optimization over convex polyhedra via Hadamard parametrizations. 91-131 - Kei Kimura, Kotaro Nakayama:
Neighborhood persistency of the linear optimization relaxation of integer linear optimization. 133-151 - Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge:
Polyhedral aspects of feedback vertex set and pseudoforest deletion set. 153-200 - Elias Samuel Wirth, Javier Peña, Sebastian Pokutta:
Accelerated affine-invariant convergence rates of the Frank-Wolfe algorithm with open-loop step-sizes. 201-245 - Brecht Evens, Pieter Pas, Puya Latafat, Panagiotis Patrinos:
Convergence of the preconditioned proximal point method and Douglas-Rachford splitting in the absence of monotonicity. 247-301 - Allan Borodin, Calum MacRury:
Online bipartite matching in the probe-commit model. 303-356 - Bin Gao, Renfeng Peng, Ya-xiang Yuan:
Low-rank optimization on Tucker tensor varieties. 357-407 - Do Sang Kim, Minh Tùng Nguyen, Tien-Son Pham:
Subdifferentials at infinity and applications in optimization. 409-440 - Yakov Vaisbourd, Rustum Choksi, Ariel Goodwin, Tim Hoheisel, Carola-Bibiane Schönlieb:
Maximum entropy on the mean and the Cramér rate function in statistical estimation and inverse problems: properties, models, and algorithms. 441-490 - Francisco J. Aragón Artacho, Pedro Pérez-Aros, David Torregrosa-Belén:
The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization. 491-537 - Han Shen, Quan Xiao, Tianyi Chen:
On penalty-based bilevel gradient descent method. 539-589 - Jiajin Li, Linglingzhi Zhu, Anthony Man-Cho So:
Nonsmooth nonconvex-nonconcave minimax optimization: Primal-dual balancing and iteration complexity analysis. 591-641 - Fuxiaoyue Feng, Chao Ding, Xudong Li:
A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity. 643-683 - Lei Huang, Jiawang Nie:
Finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization. 685-722 - Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma:
Partitioned matching games for international kidney exchange. 723-758 - Benjamin Grimmer, Danlin Li:
Some primal-dual theory for subgradient methods for strongly convex optimization. 759-788 - Yatharth Dubey, Siyue Liu:
On the smallest support size of integer solutions to linear equations. 789-800 - Emanuel Laude, Panagiotis Patrinos:
Anisotropic proximal gradient. 801-845 - Jia Liu, Zhiping Chen, Huifu Xu:
Preference ambiguity and robustness in multistage decision making. 847-939 - Elias Samuel Wirth, Javier Peña, Sebastian Pokutta:
Correction: Accelerated affine-invariant convergence rates of the Frank-Wolfe algorithm with open-loop step-sizes. 941-942
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 2026-01-07 22:12 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:
