no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A bundle-free implicit programming approach for a class of elliptic MPECs in function space
|
Hintermüller, M. |
|
2016 |
160 |
1-2 |
p. 271-305 |
article |
2 |
A copositive formulation for the stability number of infinite graphs
|
Dobre, Cristian |
|
2016 |
160 |
1-2 |
p. 65-83 |
article |
3 |
An optimal variant of Kelley’s cutting-plane method
|
Drori, Yoel |
|
2016 |
160 |
1-2 |
p. 321-351 |
article |
4 |
Approximating the little Grothendieck problem over the orthogonal and unitary groups
|
Bandeira, Afonso S. |
|
2016 |
160 |
1-2 |
p. 433-475 |
article |
5 |
Approximation algorithms for inventory problems with submodular or routing costs
|
Nagarajan, Viswanath |
|
2016 |
160 |
1-2 |
p. 225-244 |
article |
6 |
Average case polyhedral complexity of the maximum stable set problem
|
Braun, Gábor |
|
2016 |
160 |
1-2 |
p. 407-431 |
article |
7 |
Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
|
Hua, Xiaoqin |
|
2016 |
160 |
1-2 |
p. 1-32 |
article |
8 |
Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
|
Červinka, Michal |
|
2016 |
160 |
1-2 |
p. 353-377 |
article |
9 |
Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
|
Moffat, Sarah M. |
|
2016 |
160 |
1-2 |
p. 193-223 |
article |
10 |
Newton’s method may fail to recognize proximity to optimal points in constrained optimization
|
Andreani, R. |
|
2016 |
160 |
1-2 |
p. 547-555 |
article |
11 |
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
|
Feldmann, Andreas Emil |
|
2016 |
160 |
1-2 |
p. 379-406 |
article |
12 |
On the multiplier-penalty-approach for quasi-variational inequalities
|
Kanzow, Christian |
|
2016 |
160 |
1-2 |
p. 33-63 |
article |
13 |
On the polyhedrality of cross and quadrilateral closures
|
Dash, Sanjeeb |
|
2016 |
160 |
1-2 |
p. 245-270 |
article |
14 |
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
|
Balas, Egon |
|
2016 |
160 |
1-2 |
p. 85-114 |
article |
15 |
On the worst case performance of the steepest descent algorithm for quadratic functions
|
Gonzaga, Clóvis C. |
|
2016 |
160 |
1-2 |
p. 307-320 |
article |
16 |
Practical inexact proximal quasi-Newton method with global complexity analysis
|
Scheinberg, Katya |
|
2016 |
160 |
1-2 |
p. 495-529 |
article |
17 |
Second order analysis of control-affine problems with scalar state constraint
|
Aronna, M. S. |
|
2016 |
160 |
1-2 |
p. 115-147 |
article |
18 |
Some LCPs solvable in strongly polynomial time with Lemke’s algorithm
|
Adler, Ilan |
|
2016 |
160 |
1-2 |
p. 477-493 |
article |
19 |
Sparse sums of squares on finite abelian groups and improved semidefinite lifts
|
Fawzi, Hamza |
|
2016 |
160 |
1-2 |
p. 149-191 |
article |
20 |
The impact of the existence of multiple adjustable robust solutions
|
Ruiter, Frans J. C. T. de |
|
2016 |
160 |
1-2 |
p. 531-545 |
article |