Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 198
Volume 198, Number 1, March 2023
- Han Xiao
, Qizhi Fang:
Arboricity games: the core and the nucleolus. 1-25 - Yuri Faenza, Danny Segev, Lingyi Zhang:
Approximation algorithms for the generalized incremental knapsack problem. 27-83 - Moslem Zamani, Milan Hladík:
Error bounds and a condition number for the absolute value equations. 85-113 - Nikita Doikov, Yurii E. Nesterov:
Affine-invariant contracting-point methods for Convex Optimization. 115-137 - Alberto Del Pia:
Sparse PCA on fixed-rank matrices. 139-157 - R. Tyrrell Rockafellar:
Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality. 159-194 - Jean-François Aujol, Charles Dossal, Aude Rondepierre:
Convergence rates of the Heavy-Ball method under the Łojasiewicz property. 195-254 - Pavel E. Dvurechensky, Kamil Safin, Shimrit Shtern, Mathias Staudigl:
Generalized self-concordant analysis of Frank-Wolfe algorithms. 255-323 - Raghu Bollapragada, Damien Scieur, Alexandre d'Aspremont:
Nonlinear acceleration of momentum and primal-dual algorithms. 325-362 - Jason M. Altschuler, Pablo A. Parrilo:
Near-linear convergence of the Random Osborne algorithm for Matrix Balancing. 363-397 - James Saunderson, Venkat Chandrasekaran:
Terracini convexity. 399-441 - David H. Gutman, Javier F. Peña:
Perturbed Fenchel duality and first-order methods. 443-469 - Riley Murray, Helen Naumann, Thorsten Theobald:
Sublinear circuits and the constrained signomial nonnegativity problem. 471-505 - Danial Davarnia, Atefeh Rajabalizadeh, John N. Hooker:
Achieving consistency with cutting planes. 507-537 - Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Lower bounds on the size of general branch-and-bound trees. 539-559 - Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
On the optimality of pseudo-polynomial algorithms for integer programming. 561-593 - Arash Haddadan, Alantha Newman:
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours. 595-620 - Haoming Shen, Ruiwei Jiang:
Chance-constrained set covering with Wasserstein ambiguity. 621-674 - Kwassi Joseph Dzahini, Michael Kokkolaras, Sébastien Le Digabel:
Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates. 675-732 - Dogyoon Song, Pablo A. Parrilo:
On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones. 733-785 - Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. 787-810 - Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
A duality based 2-approximation algorithm for maximum agreement forest. 811-853 - Bo Jiang, Xiang Meng, Zaiwen Wen, Xiaojun Chen:
An exact penalty approach for optimization with nonnegative orthogonality constraints. 855-897 - Boris S. Mordukhovich, Xiaoming Yuan, Shangzhi Zeng, Jin Zhang:
A globally convergent proximal Newton-type method in nonsmooth convex optimization. 899-936 - Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa:
Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry. 937-996 - Coralia Cartis, Estelle M. Massart, Adilet Otemissov:
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings. 997-1058 - Guanghui Lan:
Policy mirror descent for reinforcement learning: linear convergence, new sampling complexity, and generalized problem classes. 1059-1106 - Aram V. Arutyunov, Sergey E. Zhukovskiy:
On implicit function theorem for locally Lipschitz equations. 1107-1120
Volume 198, Number 2, April 2023
- Kristin P. Bennett, Michael C. Ferris, Jong-Shi Pang, Mikhail V. Solodov, Stephen J. Wright:
Special Issue: Hierarchical Optimization. 1121-1123 - Johanna Burtscheidt, Matthias Claus, Sergio Conti, Martin Rumpf, Josua Sassen, Rüdiger Schultz:
A pessimistic bilevel stochastic problem for elastic shape optimization. 1125-1151 - Shisheng Cui, Uday V. Shanbhag, Farzad Yousefian:
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs. 1153-1225 - Shisheng Cui, Uday V. Shanbhag:
On the computation of equilibria in monotone and potential stochastic hierarchical games. 1227-1285 - Deborah B. Gahururu, Michael Hintermüller, Thomas M. Surowiec:
Risk-neutral PDE-constrained generalized Nash equilibrium problems. 1287-1337 - Andrés Gómez, Ziyu He, Jong-Shi Pang:
Linear-step solvability of some folded concave and singly-parametric sparse optimization problems. 1339-1380 - Elias S. Helou, Sandra A. Santos, Lucas E. A. Simões:
A primal nonsmooth reformulation for bilevel optimization problems. 1381-1409 - Nam Ho-Nguyen, Stephen J. Wright:
Adversarial classification via distributional robustness with Wasserstein ambiguity. 1411-1447 - Jie Jiang, Xiaojun Chen:
Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints. 1449-1484 - Jiawang Nie, Xindong Tang:
Convex generalized Nash equilibrium problems and polynomial optimization. 1485-1518 - Lingqing Shen, Nam Ho-Nguyen, Fatma Kilinç-Karzan:
An online convex optimization-based framework for convex bilevel optimization. 1519-1582 - Jane J. Ye, Xiaoming Yuan, Shangzhi Zeng, Jin Zhang:
Difference of convex algorithms for bilevel programs with applications in hyperparameter selection. 1583-1616
a service of 
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-04-22 21:02 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:
