EUVIMED · CrossrefJournal
Mathematical Programming
ISSN 0025-5610 · Springer Science and Business Media LLC
Latest articles
An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations
Strong convergence of FISTA iterates under Hölderian and quadratic growth conditions
Minimax-optimal Halpern iterations for Lipschitz maps
Inexact subgradient methods for semialgebraic functions
A simple uniformly optimal method without line search for convex optimization
Parabolic target-space interior-point algorithm for monotone weighted linear complementarity problem
Minimizing Quasi-Self-Concordant Functions by Gradient Regularization of Newton Method
A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
H-invariance theory: a complete characterization of minimax optimal fixed-point algorithms
Rank conditions for exactness of semidefinite relaxations in polynomial optimization
Online learning guided quasi-Newton methods with global non-asymptotic convergence
Algebraic characterization of equivalence between oracle-based iterative algorithms
Direct search for stochastic optimization in random subspaces with zeroth-, first-, and second-order convergence and expected complexity
Biobjective optimization with M-convex functions
Generalized assignment and knapsack problems in the random-order model
On the Bidirected Cut Relaxation for Steiner Forest
On the approximability of unsplittable flow on a path with time windows
Stochastic subgradient methods with guaranteed global stability in nonsmooth nonconvex optimization
Carathéodory number of homogeneous convex cones
An EPTAS for budgeted matching, budgeted matroid independent set, and budgeted matroid intersection via representative sets
Publisher Correction: The complete edge relaxation for binary polynomial optimization
Integral bases, perfect matchings, and the Petersen graph
Single-source unsplittable flows in planar and bounded-genus graphs
Convexification of multi-period quadratic programs with indicators
An O(log n)-approximation algorithm for (p,q)-flexible graph connectivity via independent rounding
Hypergraph connectivity augmentation in strongly polynomial time
Nonconvex matrix factorization is geodesically convex: global landscape analysis for fixed-rank matrix optimization from a Riemannian perspective
Implied integrality in mixed-integer optimization
Strongly convex maximization via the Frank-Wolfe algorithm with the Kurdyka-Łojasiewicz inequality
On the complexity of lower-order implementations of higher-order methods
Volumes
2026 · 1742025 · 1892024 · 1472023 · 1722022 · 1752021 · 1232020 · 1032019 · 1012018 · 1302017 · 1062016 · 1202015 · 1372014 · 1032013 · 1282012 · 1102011 · 822010 · 922009 · 1012008 · 432007 · 882006 · 1122005 · 892004 · 782003 · 1162002 · 782001 · 562000 · 711999 · 1051998 · 1711997 · 1871996 · 1431995 · 1551994 · 1011993 · 1261992 · 1161991 · 851990 · 1141989 · 801988 · 871987 · 76
EUVIMED