default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 178
Volume 178, Numbers 1-2, November 2019
- Jiawang Nie:
Tight relaxations for polynomial optimization and Lagrange multiplier expressions. 1-37 - Amir Beck, Nadav Hallak
:
Optimization problems involving group sparsity terms. 39-67 - Hongcheng Liu, Xue Wang, Tao Yao, Runze Li, Yinyu Ye:
Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming. 69-108 - Stefania Bellavia, Jacek Gondzio, Margherita Porcelli:
An inexact dual logarithmic barrier method for solving sparse semidefinite programs. 109-143 - Tianxiao Sun, Quoc Tran-Dinh:
Generalized self-concordant functions: a recipe for Newton-type methods. 145-213 - Huikang Liu, Anthony Man-Cho So, Weijie Wu:
Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods. 215-262 - Gabriel Haeser, Hongcheng Liu, Yinyu Ye:
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. 263-299 - Sebastian Banert, Radu Ioan Bot:
A general double-proximal gradient algorithm for d.c. programming. 301-326 - Yossi Arjevani, Ohad Shamir, Ron Shiff:
Oracle complexity of second-order methods for smooth convex optimization. 327-360 - Michele Conforti, Laurence A. Wolsey:
"Facet" separation with one linear program. 361-380 - Ying Cui, Defeng Sun, Kim-Chuan Toh:
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming. 381-415 - Jinhak Kim, Mohit Tawarmalani, Jean-Philippe P. Richard:
On cutting planes for cardinality-constrained linear programs. 417-448 - Martin Schmidt, Mathias Sirvent, Winnifried Wollner:
A decomposition method for MINLPs with Lipschitz continuous nonlinearities. 449-483 - Satoru Fujishige, Yoshio Sano, Ping Zhan:
Submodular optimization views on the random assignment problem. 485-501 - Dmitriy Drusvyatskiy, Courtney Paquette:
Efficiency of minimizing compositions of convex functions and smooth maps. 503-558
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-08-10 21:19 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:
