default search action
Mathematical Programming, Volume 194
Volume 194, Number 1, July 2022
- Tobias Harks, Veerle Timmermans
:
Equilibrium computation in resource allocation games. 1-34 - Tobias Harks, Veerle Timmermans
Correction to: Equilibrium computation in resource allocation games. 35-40 - Radu-Alexandru Dragomir
Optimal complexity and certification of Bregman first-order methods. 41-83 - Takanori Maehara
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice. 85-119 - Albert S. Berahas
Limited-memory BFGS with displacement aggregation. 121-157 - Anton Rodomanov
Rates of superlinear convergence for classical quasi-Newton methods. 159-190 - Gennadiy Averkov, Matthias Schymura
Complexity of linear relaxations in integer programming. 191-227 - Yuni Iwamasa
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications. 229-256 - Minghan Yang, Andre Milzarek
A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization. 257-303 - Shaoyan Guo
Robust spectral risk optimization when the subjective risk aversion is ambiguous: a moment-type approach. 305-340 - Joachim Dahl
A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization. 341-370 - Wen Huang
Riemannian proximal gradient methods. 371-413 - Cheng Lu
A unified approach for a 1D generalized total variation problem. 415-442 - Ngoc Hoang Anh Mai, Jean-Bernard Lasserre, Victor Magron
Positivity certificates and polynomial optimization on non-compact semialgebraic sets. 443-485 - Lénaïc Chizat:
Sparse optimization on measures with over-parameterized gradient descent. 487-532 - David de Laat
k-Point semidefinite programming bounds for equiangular lines. 533-567 - Ernest K. Ryu
Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry. 569-619 - Ke Ye
Optimization on flag manifolds. 621-660 - Stefan Lendl
Matroid bases with cardinality constraints on the intersection. 661-684 - Damian Straszak, Nisheeth K. Vishnoi:
Iteratively reweighted least squares and slime mold dynamics: connection and convergence. 685-717 - Md Sarowar Morshed
Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration. 719-779 - Mario Berta
Semidefinite programming hierarchies for constrained bilinear optimization. 781-829 - Tamás Kis
Ideal, non-extended formulations for disjunctive constraints admitting a network representation. 831-869 - Alberto Del Pia, Mingchen Ma
Proximity in concave integer quadratic programming. 871-900 - Junyu Zhang
On lower iteration complexity bounds for the convex concave saddle point problems. 901-935 - Mehdi Karimi
Status determination by interior-point methods for convex optimization problems in domain-driven form. 937-974 - Oran Gannot:
A frequency-domain analysis of inexact gradient methods. 975-1016 - M. Kanat Camlibel
Convergence of proximal solutions for evolution inclusions with time-dependent maximal monotone operators. 1017-1059 - Haihao Lu
An O(sr)-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems. 1061-1112 - Haoxiang Yang
Optimal crashing of an activity network with disruptions. 1113-1162 - Victor I. Kolobov, Simeon Reich, Rafal Zalas
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems. 1163-1183 - Gerald Beer, María J. Cánovas, Marco A. López, Juan Parra
Correction to: Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric. 1185-1186 - Guanghui Lan:
Correction to: Complexity of stochastic dual dynamic programming. 1187-1189
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-18 18:17 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: