Efficient use of parallelism in algorithmic parameter optimization applications C. AudetC.-K. DangD. Orban Original Paper 16 December 2011 Pages: 421 - 433
Global minimization of non-smooth unconstrained problems with filled function W. X. WangY. L. ShangY. Zhang Original Paper 14 December 2011 Pages: 435 - 446
On the convergence of an inexact Gauss–Newton trust-region method for nonlinear least-squares problems with simple bounds Margherita Porcelli Original Paper 28 December 2011 Pages: 447 - 465
An improved bit parallel exact maximum clique algorithm Pablo San SegundoFernando MatiaMiguel Hernando Original Paper 31 December 2011 Pages: 467 - 479
A new class of smoothing functions and a smoothing Newton method for complementarity problems Jianguang ZhuBinbin Hao Original Paper 04 January 2012 Pages: 481 - 497
Duality and Farkas-type results for extended Ky Fan inequalities with DC functions X. K. SunS. J. Li Original Paper 29 December 2011 Pages: 499 - 510
Preserving maximal monotonicity with applications in sum and composition rules Mohsen AlimohammadyVahid Dadashi Original Paper 14 January 2012 Pages: 511 - 517
A note on quadratic convergence of a smoothing Newton algorithm for the LCP Tie NiSheng-Long Hu Original Paper 31 December 2011 Pages: 519 - 531
Conjugate gradient type methods for the nondifferentiable convex minimization Qiong Li Original Paper 11 February 2012 Pages: 533 - 545
Convergence theorems for nonspreading mappings and nonexpansive multivalued mappings and equilibrium problems Mohammad Eslamian Original Paper 07 January 2012 Pages: 547 - 557
Hadamard well-posedness for a set-valued optimization problem J. ZengS. J. LiX. W. Xue Original Paper 07 January 2012 Pages: 559 - 573
Optimal execution with weighted impact functions: a quadratic programming approach Reshma KhemchandaniNishil GuptaSuresh Chandra Original Paper 21 January 2012 Pages: 575 - 592
A new hybrid stochastic approximation algorithm Zi XuXinming Wu Original Paper 01 February 2012 Pages: 593 - 606
Explicit solution for a vector-valued LQG homing problem Cloud Makasu Short Communication 21 December 2011 Pages: 607 - 612
A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times Radosław Rudek Short Communication Open access 28 January 2012 Pages: 613 - 616
Note on generalized invex functions D. H. YuanXiaoling LiuGuoming Lai Short Communication 04 February 2012 Pages: 617 - 623
