Optimization Letters, Volume 3

Volume 3, Number 1, January 2009

• M. R. Pinheiro:
  S-convexity revisited (fuzzy): long version. 1-6
  
• Olga Brezhneva, Alexey Tret'yakov, Stephen E. Wright:
  A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization. 7-10
  
• Gonglin Yuan:
  Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems. 11-21
  
• V. Jeyakumar, S. Srisatkunarajah:
  Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma. 23-33
  
• Mark A. Abramson, Charles Audet, James W. Chrissis, Jennifer G. Walston:
  Mesh adaptive direct search algorithms for mixed variable optimization. 35-47
  
• Angelos Tsoukalas, Panos Parpas, Berç Rustem:
  A smoothing algorithm for finite min-max-min problems. 49-62
  
• Chen Wang, My T. Thai, Yingshu Li, Feng Wang, Weili Wu:
  Optimization scheme for sensor coverage scheduling with bandwidth constraints. 63-75
  
• Reshma Khemchandani, Jayadeva, Suresh Chandra:
  Optimal kernel selection in twin support vector machines. 77-88
  
• E. Naraghirad:
  Characterizations of simultaneous farthest point in normed linear spaces with applications. 89-100
  
• O. L. Mangasarian:
  A generalized Newton method for absolute value equations. 101-108
  
• Leo Liberti, Nelson Maculan, Yue Zhang:
  Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem. 109-121
  
• Ahmed Ghoniem, Hanif D. Sherali:
  Complementary column generation and bounding approaches for set partitioning formulations. 123-136
  
• Katta G. Murty, Mohammad R. Oskoorouchi:
  Note on implementing the new sphere method for LP using matrix inversions sparingly. 137-160
  

Volume 3, Number 2, March 2009

• O. L. Mangasarian:
  Knapsack feasibility as an absolute value equation solvable by successive linear programming. 161-170
  
• S. K. Mishra, J. S. Rautela:
  On nonlinear multiple objective fractional programming involving semilocally type-I univex functions. 171-185
  
• Imre Pólik, Tamás Terlaky:
  New stopping criteria for detecting infeasibility in conic optimization. 187-198
  
• Amir Azaron, Farhad Kianfar:
  Due date assignment for multistage assembly systems. 199-210
  
• Katta G. Murty:
  A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes. 211-237
  
• Sanjay Sharma:
  A composite model in the context of a production-inventory system. 239-251
  
• Yong Xia:
  New optimality conditions for quadratic optimization problems with binary constraints. 253-263
  
• Linxia Qin, Lingchen Kong, Jiye Han:
  Sufficiency of linear transformations on Euclidean Jordan algebras. 265-276
  
• Z. Husain, Izhar Ahmad, Sarita Sharma:
  Second order duality for minmax fractional programming. 277-286
  
• Samuel Rota Bulò, Marcello Pelillo:
  A generalization of the Motzkin-Straus theorem to hypergraphs. 287-295
  
• Yongxi Cheng, Ding-Zhu Du, Guohui Lin:
  On the upper bounds of the minimum number of rows of disjunct matrices. 297-302
  
• Dmitri E. Kvasov, Yaroslav D. Sergeyev:
  A univariate global search working with a set of Lipschitz constants for the first derivative. 303-318
  

Volume 3, Number 3, July 2009

• Valeriano Antunes de Oliveira, Marko Antonio Rojas-Medar:
  Proper efficiency in vector infinite programming problems. 319-328
  
• Muhammad Aslam Noor, Khalida Inayat Noor, Abdelouahed Hamdi, Eman H. El-Shemas:
  On difference of two monotone operators. 329-335
  
• X. J. Long, Z. Y. Peng, B. Zeng:
  Remark on cone semistrictly preinvex functions. 337-345
  
• Steffen Rebennack, Artyom G. Nahapetyan, Panos M. Pardalos:
  Bilinear modeling solution approach for fixed charge network flow problems. 347-355
  
• Mario R. Guarracino, Altannar Chinchuluun, Panos M. Pardalos:
  Decision rules for efficient classification of biological data. 357-366
  
• Michel Minoux:
  On robust maximum flow with polyhedral uncertainty sets. 367-376
  
• Francesco Rinaldi:
  New results on the equivalence between zero-one programming and continuous concave programming. 377-386
  
• Josef Haberl:
  On global minima of semistrictly quasiconcave functions. 387-396
  
• Andrea Cassioli, Marco Sciandrone:
  A convergent decomposition method for box-constrained optimization problems. 397-409
  
• Muhammad Aslam Noor:
  Projection methods for nonconvex variational inequalities. 411-418
  
• Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando:
  On solving generalized Nash equilibrium problems via optimization. 419-435
  
• Muhammad Aslam Noor:
  On a system of general mixed variational inequalities. 437-451
  
• Shu Xu, Sheng-Jie Li:
  A new proof approach to lower semicontinuity for parametric vector equilibrium problems. 453-459
  
• Vladimir Boginski, Clayton W. Commander, Timofey Turko:
  Polynomial-time identification of robust network flows under uncertain arc failures. 461-473
  
• Luís N. Vicente:
  Implicitly and densely discrete black-box optimization problems. 475-482
  

Volume 3, Number 4, September 2009

• Andrew J. Schaefer:
  Inverse integer programming. 483-489
  
• Yujun Zheng, Chuanqing Xu, Jinyun Xue:
  A simple greedy algorithm for a class of shuttle transportation problems. 491-497
  
• Cloud Makasu:
  Bounds for a constrained optimal stopping problem. 499-505
  
• Atle Seierstad, Knut Sydsæter:
  Conditions implying the vanishing of the Hamiltonian at infinity in optimal control problems. 507-512
  
• André R. S. Amaral:
  A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem. 513-520
  
• Giovanni Fasano, Stefano Lucidi:
  A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization. 521-535
  
• V. Jeyakumar, Guoyin Li:
  Farkas' lemma for separable sublinear inequalities without qualifications. 537-545
  
• M. Daldoul, A. Baccari:
  An application of matrix computations to classical second-order optimality conditions. 547-557
  
• Semra Agrali, Joseph Geunes:
  A single-resource allocation problem with Poisson resource requirements. 559-571
  
• Igor V. Konnov:
  A splitting type algorithm for multi-valued complementarity problems. 573-582
  
• Hatem Hadda:
  A (4/3)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints. 583-592
  
• Alexander J. Zaslavski:
  A sufficient condition for exact penalty functions. 593-602
  
• Jiri Rohn:
  On unique solvability of the absolute value equation. 603-606
  

Last update Fri May 17 20:40:06 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page