default search action
Mathematical Programming, Volume 190
Volume 190, Number 1, November 2021
- Thuy Anh Ta, Tien Mai, Fabian Bastin
, Pierre L'Ecuyer:
On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling. 1-37 - Adam N. Letchford
Bi-perspective functions for mixed-integer fractional programs with indicator variables. 39-55 - Donghwan Kim:
Accelerated proximal point method for maximally monotone operators. 57-87 - Sergei Chubanov
A scaling algorithm for optimizing arbitrary functions over vertices of polytopes. 89-102 - Sergei Chubanov
Correction to: A scaling algorithm for optimizing arbitrary functions over vertices of polytopes. 103-104 - Michal Kocvara
Decomposition of arrow type positive semidefinite matrices with application to topology optimization. 105-134 - Márton Benedek
Finding and verifying the nucleolus of cooperative games. 135-170 - Bubacarr Bah
Discrete optimization methods for group model selection in compressed sensing. 171-220 - Axel Flinth
On the linear convergence rates of exchange and continuous methods for total variation minimization. 221-257 - Do Sang Kim, Boris S. Mordukhovich, Tien Son Pham, Nguyen Van Tuyen
Existence of efficient and properly efficient solutions to problems of constrained vector optimization. 259-283 - Szilárd Csaba László
Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization. 285-329 - Kun Fang
The sum-of-squares hierarchy on the sphere and applications in quantum information theory. 331-360 - Hernan Leövey, Werner Römisch
Quasi-Monte Carlo methods for two-stage stochastic mixed-integer programs. 361-392 - Sanjeeb Dash, Oktay Günlük, Dabeen Lee
Generalized Chvátal-Gomory closures for integer programs with bounds on variables. 393-425 - Taotao He, Mohit Tawarmalani
A new framework to relax composite functions in nonlinear programs. 427-466 - Samuel Fiorini, Tony Huynh
Strengthening convex relaxations of 0/1-sets using Boolean formulas. 467-482 - José Correa, Raimundo Saona, Bruno Ziliotto
Prophet secretary through blind strategies. 483-521 - Pieter Kleer
Computation and efficiency of potential function minimizers of combinatorial congestion games. 523-560 - Pedro Pérez-Aros, David Salas
Determination of convex functions via subgradients of minimal norm. 561-583 - Yang Zhan
A smooth homotopy method for incomplete markets. 585-613 - Yun Kuen Cheung, Richard Cole, Yixin Tao
Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup. 615-677 - Shaoyan Guo, Huifu Xu
Statistical robustness in utility preference robust optimization models. 679-720 - Dmitriy Kunisky
A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian. 721-759 - Niels van der Laan
A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models. 761-794 - Jean B. Lasserre
Connecting optimization with spectral analysis of tri-diagonal matrices. 795-809 - Daniel Anderson
Further results on an abstract model for branching and its application to mixed integer programming. 811-841 - Andreas Potschka
Correction to: A sequential homotopy method for mathematical programming problems. 843-844 - Samuel Burer
Correction to: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. 845-848
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-01-15 20:50 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: