default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 127
Volume 127, Number 1, March 2011
- Alexandre d'Aspremont, Francis R. Bach, Inderjit S. Dhillon, Bin Yu:
Preface. 1-2 - Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro, Andrew Cotter:
Pegasos: primal estimated sub-gradient solver for SVM. 3-30 - Yurii E. Nesterov:
Barrier subgradient method. 31-56 - Anatoli B. Juditsky, Arkadi Nemirovski
:
On verifiable sufficient conditions for sparse signal recovery via ℓ1 minimization. 57-88 - Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski:
Verifiable conditions of ℓ1-recovery for sparse signals with sign restrictions. 89-122 - Alexandre d'Aspremont, Laurent El Ghaoui:
Testing the nullspace property using semidefinite programming. 123-144 - Aharon Ben-Tal, Sahely Bhadra, Chiranjib Bhattacharyya, J. Saketha Nath:
Chance constrained uncertain classification via robust optimization. 145-173 - Benjamin Recht, Weiyu Xu, Babak Hassibi:
Null space conditions and thresholds for rank minimization. 175-202 - Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye:
Statistical ranking and combinatorial Hodge theory. 203-244
Volume 127, Number 2, April 2011
- Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint:
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. 245-295 - Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura:
Efficient branch-and-bound algorithms for weighted MAX-2-SAT. 297-343 - Jochen Könemann, David Pritchard, Kunlun Tan:
A partition-based relaxation for Steiner trees. 345-370 - Marco Colombo, Jacek Gondzio, Andreas Grothey:
A warm-start approach for large-scale stochastic linear programs. 371-397 - Paul Tseng, Immanuel M. Bomze, Werner Schachinger:
A first-order interior-point method for linearly constrained smooth optimization. 399-424 - Patrick D. Mackin, Asim Roy, Jyrki Wallenius:
An interactive weight space reduction procedure for nonlinear multiple objective mathematical programming. 425-444
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-12-19 22:15 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:
