Journal: Optimization Letters

Volume 6, Issue 5

827 -- 840Roman V. Belavkin. On evolution of an information dynamic system and its generating operator
841 -- 849Jean-Baptiste Hiriart-Urruty, Hai Yen Le. Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
851 -- 856Jiri Rohn. An algorithm for computing all solutions of an absolute value equation
857 -- 866Immanuel M. Bomze, Marco Locatelli. Separable standard quadratic optimization problems
867 -- 882Roy Cerqueti, Anna Grazia Quaranta. The perspective of a bank in granting credits: an optimization model
883 -- 891Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier. Parameterized computational complexity of finding small-diameter subgraphs
893 -- 899Milan Hladík. Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
901 -- 914Elisa Pagani. On Lagrangian duality in vector optimization: applications to the linear case
915 -- 926Pavel A. Borisovsky, Alexandre Dolgui, Sergey Kovalev. Modelling transfer line design problem via a set partitioning problem
927 -- 940Roger Behling, Andreas Fischer. A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods
941 -- 955Hideaki Iiduka, Yasushi Narushima. Conjugate gradient methods using value of objective function for unconstrained optimization
957 -- 961Atid Kangtunyakarn. Convergence theorem of common fixed points for a family of nonspreading mappings in Hilbert space
963 -- 973Nicolas Zufferey. Optimization by ant algorithms: possible roles for an individual ant
975 -- 992Yi-gui Ou, Guan-shu Wang. A new supermemory gradient method for unconstrained optimization problems
993 -- 1008Rahul Varshney, Najmussehar, M. J. Ahsan. An optimum multivariate stratified double sampling design in presence of non-response
1009 -- 1015A. V. Arutyunov. On two questions of optimization theory concerning quadratic mappings
1017 -- 1020Jiri Rohn. On Rump's characterization of P-matrices
1021 -- 1025Radoslaw Rudek. A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times
1027 -- 1033Muhammad Aslam Noor, Javed Iqbal, Khalida Inayat Noor, Eisa A. Al-Said. On an iterative method for solving absolute value equations