default search action
Mathematical Programming, Volume 187
Volume 187, Number 1, May 2021
- Serge Gratton, Ehouarn Simon
, Philippe L. Toint
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity. 1-24 - Mathieu Dutour Sikiric
A simplex algorithm for rational cp-factorization. 25-45 - Xiaojun Chen
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms. 47-78 - Javier Peña
New characterizations of Hoffman constants for systems of linear constraints. 79-109 - Danial Davarnia
Outer approximation for integer nonlinear programs via decision diagrams. 111-150 - Vassilis Apidopoulos
Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions. 151-193 - Matthias Köppe
Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem. 195-252 - Christopher Thomas Ryan
Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs. 253-285 - Yong Xia
Chebyshev center of the intersection of balls: complexity, relaxation and approximation. 287-315 - Haihao Lu
Generalized stochastic Frank-Wolfe algorithm with stochastic "substitute" gradient for structured convex optimization. 317-349 - Laurence A. Wolsey, Hande Yaman
Convex hull results for generalizations of the constant capacity single node flow set. 351-382 - Bin Hu, Peter Seiler
Analysis of biased stochastic gradient descent using sequential semidefinite programs. 383-408 - Shi Pu
Distributed stochastic gradient tracking methods. 409-457 - Andreas Potschka
A sequential homotopy method for mathematical programming problems. 459-486 - Guanghui Lan, Zhiqiang Zhou:
Dynamic stochastic approximation for multi-stage stochastic optimization. 487-532 - Vincent Guigues:
Inexact stochastic mirror descent for two-stage nonlinear stochastic programs. 533-577 - Frank E. Curtis
Regional complexity analysis of algorithms for nonconvex smooth optimization. 579-615 - Christian Füllner
Convergent upper bounds in global minimization with nonlinear equality constraints. 617-651 - Toni Böhnlein, Stefan Kratsch, Oliver Schaudt:
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting. 653-695 - Andreas Fischer
Unit stepsize for the Newton method close to critical solutions. 697-721
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-04-14 00:20 CEST 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: