Volume 25, Number 1, 2010

• 
  Masao Fukushima, Manlio Gaudioso, Franco Giannessi, Diethard Pallaschke: Foreword. 1-2
• 
  Adil M. Bagirov, Asef Nazari Ganjehlou: A quasisecant method for minimizing nonsmooth functions. 3-18
• 
  Giancarlo Bigi, Antonio Frangioni, Qinghua Zhang: Approximate optimality conditions and stopping criteria in canonical DC programming. 19-27
• 
  Giancarlo Bigi, Barbara Panicucci: A successive linear programming algorithm for nonsmooth monotone variational inequalities. 29-35
• 
  Radu Ioan Bot, Sorin-Mihai Grad: Lower semicontinuous type regularity conditions for subdifferential calculus. 37-48
• 
  Marco Castellani, Massimo Pappalardo, Mauro Passacantando: Existence results for nonconvex equilibrium problems. 49-58
• 
  Manlio Gaudioso, Enrico Gorgone: Gradient set splitting in nonconvex nonsmooth numerical optimization. 59-74
• 
  Ivan Ginchev, Angelo Guerraggio, Matteo Rocca: Second-order Dini set-valued directional derivative in C ^{1, 1} vector optimization. 75-87
• 
  Jerzy Grzybowski, Diethard Pallaschke, Ryszard Urbanski: On the amount of minimal pairs of convex sets. 89-96
• 
  Evgeni A. Nurminski: Envelope stepsize control for iterative algorithms based on Fejer processes with attractants. 97-108
• 
  N. Ovcharova: Second-order analysis of the Moreau-Yosida and the Lasry-Lions regularizations. 109-116
• 
  Francesco Rinaldi, Marco Sciandrone: Feature selection combining linear support vector machines and concave optimization. 117-128
• 
  Vera Roshchina: Mordukhovich subdifferential of pointwise minimum of approximate convex functions. 129-141
• 
  A. Uderzo: On a perturbation approach to open mapping theorems. 143-167

Volume 25, Number 2, 2010

• 
  Ekaterina A. Kostina, Tamás Terlaky: Foreword. 169-170
• 
  Indra Adrianto, Theodore B. Trafalis: The p-Centre machine for regression analysis. 171-183
• 
  R. De Leone, C. Lazzari: Error bounds for support vector machines with application to the identification of active constraints. 185-202
• 
  Josep Freixas, Xavier Molinero: Weighted games without a unique minimal representation in integers. 203-215
• 
  Constantin Gaul, Sascha Kurz, Jörg Rambau: On the lot-type design problem. 217-227
• 
  Alireza Ghaffari Hadigheh, Oleksandr Romanko, Tamás Terlaky: Bi-parametric convex quadratic optimization. 229-245
• 
  Margaréta Halická, Mária Trnovská: Limiting behaviour and analyticity of weighted central paths in semidefinite programming. 247-262
• 
  Kun He, Wenqi Huang: Solving the single-container loading problem by a fast heuristic method. 263-277
• 
  O. I. Kostyukova, T. V. Tchemisova: Sufficient optimality conditions for convex semi-infinite programming. 279-297
• 
  Carina Maria Oliveira Pimentel, Filipe Pereira Alvelos, José Manuel Valério de Carvalho: Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. 299-319
• 
  Marta I. Velazco Fontova, Aurelio R. L. Oliveira, F. F. Campos: A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods. 321-332

• 
  Philippe L. Toint: Book review. 333-334

Volume 25, Number 3, 2010

• 
  Botond Bertók, Tamás Terlaky: Preface. 335-336
• 
  Geir Gundersen, Trond Steihaug: On large-scale unconstrained optimization problems and higher order methods. 337-358
• 
  Serge Gratton, Mélodie Mouffe, Annick Sartenaer, Philippe L. Toint, Dimitri Tomanos: Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization. 359-386
• 
  Mohamed El Ghami, Cornelis Roos, Trond Steihaug: A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions. 387-403
• 
  I. D. Ivanov, E. de Klerk: Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster. 405-420
• 
  Enrico Angelelli, Maria Grazia Speranza, József Szoldatics, Zsolt Tuza: Geometric representation for semi on-line scheduling on uniform processors. 421-428
• 
  Ebrahim Nasrabadi, S. Mehdi Hashemi: Minimum cost time-varying network flow problems. 429-447
• 
  Csaba Mészáros: On the implementation of interior point methods for dual-core platforms. 449-456
• 
  Maziar Salahi, Saeed Ketabchi: Correcting an inconsistent set of linear inequalities by the generalized Newton method. 457-465
• 
  Mohammad H. Koulaei, Tamás Terlaky: On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization. 467-485

• 
  Panos M. Pardalos: Convex optimization theory. 487

Volume 25, Number 4, 2010

• 
  A. Malek, N. Hosseinipour-Mahani, S. Ezazipour: Efficient recurrent neural network model for the solution of general nonlinear optimization problems. 489-506
• 
  Serge Gratton, Philippe L. Toint: Approximate invariant subspaces and quasi-newton optimization methods. 507-529
• 
  Moritz Diehl, Andrea Walther, Hans Georg Bock, Ekaterina Kostina: An adjoint-based SQP algorithm with quasi-Newton Jacobian updates for inequality constrained optimization. 531-552
• 
  Julia Sternberg, Michael Hinze: A memory-reduced implementation of the Newton-CG method in optimal control of nonlinear time-dependent PDEs. 553-571
• 
  Martin Gugat, Michael Herty: The smoothed-penalty algorithm for state constrained optimal control problems for partial differential equations. 573-599
• 
  Sven Leyffer, Todd Munson: Solving multi-leader-common-follower games. 601-623
• 
  Debora Mahlke, Alexander Martin, Susanne Moritz: A mixed integer approach for time-dependent gas network optimization. 625-644
• 
  Adel Hamdi, Andreas Griewank: Properties of an augmented Lagrangian for design optimization. 645-664

Volume 25, Number 5, 2010

• 
  Xuexiang Huang, Jie Sun, Xiaoqi Yang, Xinmin Yang: Preface: Special section on the 2nd International Conference on Nonlinear Programming with Applications. 665

• 
  Sanming Liu, Enmin Feng: The exponential penalty function method for multiobjective programming problems. 667-675
• 
  Jian-Wen Peng, Jen-Chih Yao: Some new extragradient-like methods for generalized equilibrium problems, fixed point problems and variational inequality problems. 677-698
• 
  Guanghui Wang, Song Wang: Convergence of a finite element approximation to a degenerate parabolic variational inequality with non-smooth data arising from American option valuation. 699-723
• 
  Ka Fai Cedric Yiu, Wei-Yong Yan, Kok Lay Teo, Siow Yong Low: A new hybrid descent method with application to the optimal design of finite precision FIR filters. 725-735
• 
  K. Zhang, X. Q. Yang, S. Wang, K. L. Teo: Numerical performance of penalty method for American option pricing. 737-752

• 
  Haibin Zhang: On the Halley class of methods for unconstrainedoptimization problems. 753-762
• 
  Leonid Faybusovich: Jordan-algebraic aspects of optimization: randomization. 763-779
• 
  Yong-Jun Wang: Improving particle swarm optimization performance with local search for high-dimensional function optimization. 781-795
• 
  Joshua D. Griffin, Tamara G. Kolda: Asynchronous parallel hybrid optimization combining DIRECT and GSS. 797-817
• 
  Shigeru Hanba: Globally convergent Jacobian-free nonlinear equation solvers based on non-monotone norm descent conditions and a modified line search technique. 819-837

Volume 25, Number 6, 2010

• 
  Jose Herskovits Norman, Klaus Schittkowski: Foreword. 839
• 
  Timo Aittokoski, K. Miettinen: Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA. 841-858
• 
  Felipe Alvarez, Julio López, Héctor Ramírez Cabrera: Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines. 859-881
• 
  Márcia A. Gomes-Ruggiero, Mael Sachine, Sandra Augusta Santos: A spectral updating for the method of moving asymptotes. 883-893
• 
  Napsu Karmitsa, Marko M. Mäkelä: Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis. 895-916
• 
  Welington Luis de Oliveira, Claudia A. Sagastizábal, Débora Dias Jardim Penna, Maria Elvira Piñeiro Maceira, Jorge Machado Damázio: Optimal scenario tree reduction for stochastic streamflows in power generation planning problems. 917-936
• 
  Süreyya Özögür-Akyüz, G.-W. Weber: Infinite kernel learning via infinite and semi-infinite programming. 937-970

• 
  L. Grippo, Marco Sciandrone: Nonmonotone globalization of the finite-difference Newton-GMRES method for nonlinear equations. 971-999

last updated on Sun May 26 05:12:00 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page