1.
Sample size selection in optimization methods for machine learning
by Byrd, Richard H
Mathematical programming, 2012, Vol.134 (1), p.127-155
2.
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results
by Cartis, Coralia
Mathematical programming, 2009, Vol.127 (2), p.245-295
3.
Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity
by Cartis, Coralia
Mathematical programming, 2010, Vol.130 (2), p.295-319
4.
Smoothing methods for nonsmooth, nonconvex minimization
by Chen, Xiaojun
Mathematical programming, 2012, Vol.134 (1), p.71-99
5.
Is bilevel programming a special case of a mathematical program with complementarity constraints?
by Dempe, S
Mathematical programming, 2010, Vol.131 (1-2), p.37-48
6.
Differential variational inequalities
by Pang, Jong-Shi
Mathematical programming, 2007, Vol.113 (2), p.345-424
7.
Relative Pareto minimizers for multiobjective problems: existence and optimality conditions
by Bao, Truong Q
Mathematical programming, 2008, Vol.122 (2), p.301-347
8.
A relaxed constant positive linear dependence constraint qualification and applications
by Andreani, Roberto
Mathematical programming, 2011, Vol.135 (1-2), p.255-273
9.
Approximation accuracy, gradient methods, and error bound for structured convex optimization
by Tseng, Paul
Mathematical programming, 2010, Vol.125 (2), p.263-295
10.
The integer approximation error in mixed-integer optimal control
by Sager, Sebastian
Mathematical programming, 2010, Vol.133 (1-2), p.1-23
11.
On the power and limitations of affine policies in two-stage adaptive optimization
by Bertsimas, Dimitris
Mathematical programming, 2011, Vol.134 (2), p.491-531
12.
Global minimization using an Augmented Lagrangian method with variable lower-level constraints
by Birgin, E. G
Mathematical programming, 2009, Vol.125 (1), p.139-162
13.
Fixed point optimization algorithm and its application to power control in CDMA data networks
by Iiduka, Hideaki
Mathematical programming, 2010, Vol.133 (1-2), p.227-242
14.
Divide to conquer: decomposition methods for energy optimization
by SAGASTIZABAL, C
Mathematical programming, 2012, Vol.134 (1), p.187-222
15.
Subgradients of marginal functions in parametric mathematical programming
by Mordukhovich, B. S
Mathematical programming, 2007, Vol.116 (1-2), p.369-396
16.
An augmented Lagrangian approach for sparse principal component analysis
by Lu, Zhaosong
Mathematical programming, 2011, Vol.135 (1-2), p.149-193
17.
Hölder metric regularity of set-valued maps
by Frankowska, Hélène
Mathematical programming, 2010, Vol.132 (1-2), p.333-354
18.
A line search exact penalty method using steering rules
by Byrd, Richard H
Mathematical programming, 2010, Vol.133 (1-2), p.39-73
19.
Accelerating the cubic regularization of Newton’s method on convex problems
by Nesterov, Yu
Mathematical programming, 2007, Vol.112 (1), p.159-181
20.
A note on the selection of Benders’ cuts
by Fischetti, Matteo
Mathematical programming, 2010, Vol.124 (1-2), p.175-182
