Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             15 results found
no title author magazine year volume issue page(s) type
1 A decomposition method for MINLPs with Lipschitz continuous nonlinearities Schmidt, Martin
2018
178 1-2 p. 449-483
article
2 A general double-proximal gradient algorithm for d.c. programming Banert, Sebastian
2018
178 1-2 p. 301-326
article
3 An inexact dual logarithmic barrier method for solving sparse semidefinite programs Bellavia, Stefania
2018
178 1-2 p. 109-143
article
4 Efficiency of minimizing compositions of convex functions and smooth maps Drusvyatskiy, D.
2018
178 1-2 p. 503-558
article
5 “Facet” separation with one linear program Conforti, Michele
2018
178 1-2 p. 361-380
article
6 Generalized self-concordant functions: a recipe for Newton-type methods Sun, Tianxiao
2018
178 1-2 p. 145-213
article
7 On cutting planes for cardinality-constrained linear programs Kim, Jinhak
2018
178 1-2 p. 417-448
article
8 On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming Cui, Ying
2018
178 1-2 p. 381-415
article
9 Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary Haeser, Gabriel
2018
178 1-2 p. 263-299
article
10 Optimization problems involving group sparsity terms Beck, Amir
2018
178 1-2 p. 39-67
article
11 Oracle complexity of second-order methods for smooth convex optimization Arjevani, Yossi
2018
178 1-2 p. 327-360
article
12 Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods Liu, Huikang
2018
178 1-2 p. 215-262
article
13 Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming Liu, Hongcheng
2018
178 1-2 p. 69-108
article
14 Submodular optimization views on the random assignment problem Fujishige, Satoru
2018
178 1-2 p. 485-501
article
15 Tight relaxations for polynomial optimization and Lagrange multiplier expressions Nie, Jiawang
2018
178 1-2 p. 1-37
article
                             15 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands