default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 201
Volume 201, Number 1, September 2023
- Yuhao Zhou, Chenglong Bao
, Chao Ding, Jun Zhu:
A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds. 1-61 - Marc Teboulle, Yakov Vaisbourd:
An elementary approach to tight worst case complexity analysis of gradient based methods. 63-96 - Li Wang, Lei-Hong Zhang, Ren-Cang Li:
Trace ratio optimization with an application to multi-view learning. 97-131 - David L. Applegate, Oliver Hinder, Haihao Lu, Miles Lubin:
Faster first-order primal-dual methods for linear programming using restarts and sharpness. 133-184 - Mathieu Barré, Adrien B. Taylor, Francis R. Bach:
Principled analyses and design of first-order methods with inexact proximal operators. 185-230 - Yura Malitsky, Matthew K. Tam:
Resolvent splitting for sums of monotone operators with minimal lifting. 231-262 - Alberto Del Pia:
An approximation algorithm for indefinite mixed integer quadratic programming. 263-293 - Alper Atamtürk, Andrés Gómez:
Supermodularity and valid inequalities for quadratic optimization with indicators. 295-338 - Johannes O. Royset:
Consistent approximations in composite optimization. 339-372 - Benjamin Grimmer, Haihao Lu, Pratik Worah, Vahab Mirrokni:
The landscape of the proximal point method for nonconvex-nonconcave minimax optimization. 373-407 - Heng Yang, Ling Liang, Luca Carlone, Kim-Chuan Toh:
An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization. 409-472 - Sen Na, Michal Derezinski, Michael W. Mahoney:
Hessian averaging in stochastic Newton methods achieves superlinear convergence. 473-520 - Lior Doron, Shimrit Shtern:
Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems. 521-558 - Robert J. Baraldi, Drew P. Kouri:
A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations. 559-598 - Ching-Pei Lee:
Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification. 599-633 - Zi Xu, Huiling Zhang, Yang Xu, Guanghui Lan:
A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems. 635-706 - Gen Li, Yuting Wei, Yuejie Chi, Yuxin Chen:
Softmax policy gradient methods can take exponential time to converge. 707-802 - Qimeng Yu, Simge Küçükyavuz:
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints. 803-861 - Alberto De Marchi, Xiaoxi Jia, Christian Kanzow, Patrick Mehlitz:
Constrained composite optimization and augmented Lagrangian methods. 863-896 - Clarice Poon, Gabriel Peyré:
Smooth over-parameterized solvers for non-smooth structured optimization. 897-952
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-12-20 23:48 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:
