External Links

    Journal: Optimization Letters

    Volume 12, Issue 8

    1713 -- 1724Frank E. Curtis, Zachary Lubberts, Daniel P. Robinson. Concise complexity analyses for trust region methods
    1725 -- 1739Marco Locatelli. Convex envelopes of separable functions over regions defined by separable functions of the same type
    1741 -- 1753Alberto Franzin, Leslie Pérez Cáceres, Thomas Stützle. Effect of transformations of numerical parameters in automatic algorithm configuration
    1755 -- 1772Juan Parra Galvez, Denis Borenstein, Everton da Silveira Farias. Application of optimization for solving a sawing stock problem with a cant sawing pattern
    1773 -- 1787Abderrahim Hantoute, Emilio Vilches. Lyapunov pairs for perturbed sweeping processes
    1789 -- 1810Boualem Alleche, Vicentiu D. Radulescu. Further on set-valued equilibrium problems in the pseudo-monotone case and applications to Browder variational inclusions
    1811 -- 1824Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico. A savings-based model for two-shipper cooperative routing
    1825 -- 1839A. V. Fominyh, V. V. Karelin, L. N. Polyakova. Application of the hypodifferential descent method to the problem of constructing an optimal control
    1841 -- 1854Margarita Domènech, José Miguel Giménez, María Albina Puente. Semivalues: weighting coefficients and allocations on unanimity games
    1855 -- 1870Ido Halperin, Grigory Agranovich, Yuri Ribakov. Optimal control synthesis for the constrained bilinear biquadratic regulator problem
    1871 -- 1896Qiao-Li Dong, Yeol Je Cho, Themistocles M. Rassias. The projection and contraction methods for finding common solutions to variational inequality problems
    1897 -- 1910Giandomenico Mastroeni, Massimo Pappalardo. Quasi-variational equilibrium models for network flow problems
    1911 -- 1927Min Li. A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method
    1929 -- 1945C. L. Yao, S. J. Li. Efficient and weakly efficient solutions for the vector topical optimization
    1947 -- 1957Esmaeel Moradi, Balabhaskar Balasundaram. Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
    1959 -- 1969Yajun Lu, Esmaeel Moradi, Balabhaskar Balasundaram. Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
    1971 -- 1980Valentin V. Gorokhovik, Marina Trafimovich. Saddle representations of positively homogeneous functions by linear functions

    Volume 12, Issue 7

    1465 -- 1474Heinz H. Bauschke, Walaa M. Moursi. The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings
    1475 -- 1486James Saunderson. A spectrahedral representation of the first derivative relaxation of the positive semidefinite cone
    1487 -- 1502Maria C. Jansen, Osman Y. Özaltin. Optimal production in a competitive market under yield uncertainty
    1503 -- 1521Yiling Zhang, Siqian Shen, S. Ayca Erdogan. Solving 0-1 semidefinite programs for distributionally robust allocation of surgery blocks
    1523 -- 1533André B. Chassein, Marc Goerigk. On scenario aggregation to approximate robust combinatorial optimization problems
    1535 -- 1551Stefano Sebastio, Giorgio Gnecco. A green policy to schedule tasks in a distributed cloud
    1553 -- 1568Theo Karaboghossian, Michele Zito. Easy knapsacks and the complexity of energy allocation problems in the smart grid
    1569 -- 1587Thi Hoai Pham, Hoang Tuy. Monotonic optimization for sensor cover energy problem
    1589 -- 1608Jianchao Bai, Hongchao Zhang, Jicheng Li. A parameterized proximal point algorithm for separable convex optimization
    1609 -- 1623Bayi Cheng, Jun Pei, Kai Li, Panos M. Pardalos. Integrated scheduling of production and distribution for manufacturers with parallel batching facilities
    1625 -- 1638Nguyen Thi Thu Ha, Jean-Jacques Strodiot, Phan Tu Vuong. On the global exponential stability of a projected dynamical system for strongly pseudomonotone variational inequalities
    1639 -- 1658Hao Zhang 0037, Qin Ni. A new regularized quasi-Newton method for unconstrained optimization
    1659 -- 1667Marco Vianello. Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization
    1669 -- 1681Eduardo Álvarez-Miranda, Martin Luipersbeck, Markus Sinnl. An exact solution framework for the minimum cost dominating tree problem
    1683 -- 1697Makoto Yamashita, Tim J. Mullin, Sena Safarina. An efficient second-order cone programming approach for optimal selection in tree breeding
    1699 -- 1712Linas Stripinis, Remigijus Paulavicius, Julius Zilinskas. Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT

    Volume 12, Issue 6

    1157 -- 1159Kok Lay Teo, Adil M. Bagirov, Wuyi Yue. Preface of the special issue: the 6th International Conference on Optimization and Control with Applications (6th OCA)
    1161 -- 1178Song Wang 0004, Kai Zhang. An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering
    1179 -- 1197Jueyou Li, Guoquan Li, Zhiyou Wu, Changzhi Wu. Stochastic mirror descent method for distributed multi-agent optimization
    1199 -- 1213Qingling Zhang 0001, Jinghao Li, Zhongyan Song. Sliding mode control for discrete-time descriptor Markovian jump systems with two Markov chains
    1215 -- 1235Jianping Liu, Shunfu Jin, Wuyi Yue. A novel adaptive spectrum reservation strategy in CRNs and its performance optimization
    1237 -- 1247Sarah Yini Gao, Jie Sun 0001, Soon-Yi Wu. A semi-infinite programming approach to two-stage stochastic linear programs with high-order moment constraints
    1249 -- 1264Chongyang Liu, Zhaohua Gong, Kok Lay Teo, Ryan C. Loxton, Enmin Feng. Bi-objective dynamic optimization of a nonlinear time-delay system in microbial batch process
    1265 -- 1280G. H. Li, S. J. Li. Saddle points and gap functions for weak generalized Ky Fan inequalities
    1281 -- 1300Yuan Zhao, Wuyi Yue. Performance analysis and optimization of cognitive radio networks with retransmission control
    1301 -- 1314Yan Wang, Aimin Song, Lei Wang 0035, Jie Sun. Maximum principle via Malliavin calculus for regular-singular stochastic differential games
    1315 -- 1328Ke-Wei Ding, Ming-Hui Wang, Nan-Jing Huang. Distributionally robust chance constrained problem under interval distribution information
    1329 -- 1337Zhi-Ang Zhou, Xin-Min Yang, Xuan Wan. The semi-E cone convex set-valued map and its applications
    1339 -- 1356Z. Y. Peng, X. B. Li, X. J. Long, X. D. Fan. Painlevé-Kuratowski stability of approximate efficient solutions for perturbed semi-infinite vector optimization problems
    1357 -- 1371Zhong Bao Wang, Zi-li Chen, Zhangyou Chen, Sisheng Yao. Lagrangian methods for optimal control problems governed by a mixed quasi-variational inequality
    1373 -- 1386Bin Li 0005, Zhi Guo Feng, Hai Huyen Dam, Antonio Cantoni. A reduced complexity zero-forcing beamformer design for multiuser MIMO systems
    1387 -- 1402Xiao-Bing Li, Song Wang. Characterizations of robust solution set of convex programs with uncertain data
    1403 -- 1420Xiang-Kai Sun, Liping Tang, Xian-jun Long, Minghua Li. Some dual characterizations of Farkas-type results for fractional programming problems
    1421 -- 1441Li Yu, Wenjuan Fan, Jun Pei, Panos M. Pardalos. A study on the effect of yield uncertainty in price-setting newsvendor models with additive-multiplicative demand
    1443 -- 1454Mohamed A. Tawhid, Saeed Rahmati. Complementarity problems over a hypermatrix (tensor) set
    1455 -- 1464G. Q. Li, Q. Long, L. Jiang. Global optimality conditions for fixed charge quadratic programs

    Volume 12, Issue 5

    933 -- 943Takahito Kuno, Yoshio Sano, Takahiro Tsuruda. Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm
    945 -- 957Andrea Lodi 0001, Ahmad Moradi. Experiments on virtual private network design with concave capacity costs
    959 -- 969Ning Zhang. Two-stage robust mixed integer programming problem with objective uncertainty
    971 -- 984Khanh Duy Pham, Nhut Minh Bui. Error bounds for strongly monotone and Lipschitz continuous variational inequalities
    985 -- 996Cheng Lu, Zhibin Deng. DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
    997 -- 1009P. J. S. Santos, P. S. M. Santos, Susana Scheimberg. A proximal Newton-type method for equilibrium problems
    1011 -- 1017Peter Frankl. An exact result for (0, ± 1)-vectors
    1019 -- 1027Matthew K. Tam. Algorithms based on unions of nonexpansive maps
    1029 -- 1044Peter Wanke, A. Hadi Vencheh, A. Forghani. A DDF based model for efficiency evaluation in two-stage DEA
    1045 -- 1063Nguyen Nang Tam, Tran Van Nghi. On the solution existence and stability of quadratically constrained nonconvex quadratic programs
    1065 -- 1077Xiucui Guan, Panos M. Pardalos, Binwu Zhang. 1 norm by modifying the sum-cost vector
    1079 -- 1097Mousaab Bouafia, Djamel Benterki, Adnan Yassine. An efficient parameterized logarithmic kernel function for linear optimization
    1099 -- 1116Zsolt Darvay, Petra-Renáta Takács. New method for determining search directions for interior-point algorithms in linear optimization
    1117 -- 1139Zhou Wei, Jen-Chih Yao. On Constraint qualifications of a nonconvex inequality
    1141 -- 1154Joachim Gwinner. An optimization approach to parameter identification in variational inequalities of second kind
    1155 -- 1156Dragan Jukic. An elementary proof of the quadratic envelope characterization of zero-derivative points

    Volume 12, Issue 4

    675 -- 689Charles Audet, Amina Ihaddadene, Sébastien Le Digabel, Christophe Tribes. Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm
    691 -- 712Claudia D'Ambrosio, Fabio Furini, Michele Monaci, Emiliano Traversi. On the Product Knapsack Problem
    713 -- 725Bjarne Grimstad. A MIQCP formulation for B-spline constraints
    727 -- 741Nélio Henderson, Marroni de Sá Rêgo, Janaína Imbiriba, Márlison de Sá Rêgo, Wagner F. Sacco. Testing the topographical global initialization strategy in the framework of an unconstrained optimization method
    743 -- 761Marco César Goldbarg, Elizabeth Ferreira Gouvea Goldbarg, Henrique P. L. Luna, Matheus da Silva Menezes, Lucas Corrales. Integer programming models and linearizations for the traveling car renter problem
    763 -- 780Jinjiang Yuan. Complexities of four problems on two-agent scheduling
    781 -- 798Yaguang Yang, Makoto Yamashita. An arc-search $${\mathcal {O}}(nL)$$ O ( n L ) infeasible-interior-point algorithm for linear programming
    799 -- 815Nguyen Thanh Qui, Hoang Ngoc Tuan. Stability of generalized equations under nonlinear perturbations
    817 -- 830Aviv Gibali, Li-Wei Liu, Yu-Chao Tang. Note on the modified relaxation CQ algorithm for the split feasibility problem
    831 -- 843Samir Adly, Ba Khiet Le. On semicoercive sweeping process with velocity constraint
    845 -- 873Hongwei Liu, Zexian Liu, Xiaoliang Dong. A new adaptive Barzilai and Borwein method for unconstrained optimization
    875 -- 883Zuping Wu, Yong Xia, Shu Wang. Approximating the weighted maximin dispersion problem over an $$\ell _p$$ ℓ p -ball: SDP relaxation is misleading
    885 -- 902S. Mirzadeh, H. Mohebi. Global minimization of the difference of increasing co-radiant and quasi-concave functions
    903 -- 914Sophie Jacquin, Fanny Dufossé, Laetitia Jourdan. An exact algorithm for the bi-objective timing problem
    915 -- 922Sorin-Mihai Grad. Characterizations via linear scalarization of minimal and properly minimal elements
    923 -- 931Marius Durea, Radu Strugariu. Optimality conditions and a barrier method in optimization with convex geometric constraint

    Volume 12, Issue 3

    435 -- 442Milan Korda, Didier Henrion. Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
    443 -- 454Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Selene Silvestri. On the complexity of rainbow spanning forest problem
    455 -- 473Nguyen Mau Nam, Wondi Geremew, Sam Reynolds, Tuyen Tran. Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
    475 -- 483Markó Horváth, Tamás Kis. Multi-criteria approximation schemes for the resource constrained shortest path problem
    485 -- 497Natasa Krejic, Natasa Krklec Jerinkic, Andrea Roznjik. Variable sample size method for equality constrained optimization problems
    499 -- 518Jaehyun Park, Stephen Boyd. A semidefinite programming method for integer convex quadratic minimization
    519 -- 534Shuqin Sun, Yiran He. Exact characterization for subdifferentials of a special optimal value function
    535 -- 549Ton Kloks, Yue-Li Wang. On retracts, absolute retracts, and foldings in cographs
    551 -- 566Dang Van Hieu. Projected subgradient algorithms on systems of equilibrium problems
    567 -- 583Bruno Nogueira, Rian G. S. Pinheiro, Anand Subramanian. A hybrid iterated local search heuristic for the maximum weight independent set problem
    585 -- 613János D. Pintér, Frank J. Kampas, Ignacio Castillo. d: a computational study
    615 -- 623César Gutiérrez, Vicente Novo, Juan Luis Ródenas-Pedregosa. A note on existence of weak efficient solutions for vector equilibrium problems
    625 -- 637Lu Han, Dachuan Xu, Min Li, Dongmei Zhang. Approximation algorithms for the robust facility leasing problem
    639 -- 648R. Balaji, K. Palpandi. Positive definite and Gram tensor complementarity problems
    649 -- 659Dorit S. Hochbaum, Asaf Levin. Weighted matching with pair restrictions
    661 -- 673Mustafa Ç. Pinar. On explicit solutions of a two-echelon supply chain coordination game

    Volume 12, Issue 2

    235 -- 250Maxence Delorme, Manuel Iori, Silvano Martello. BPPLIB: a library for bin packing and cutting stock problems
    251 -- 263Ge Yu, Sheldon H. Jacobson. Online C-benevolent job scheduling on multiple machines
    265 -- 272Dakui Jiang, Jiayin Tan. Scheduling with job delivery coordination on single machine
    273 -- 286Giuseppe Caristi, Nader Kanzi, Majid Soleimani-Damaneh. On gap functions for nonsmooth multiobjective optimization problems
    287 -- 299Hui Huang, Man He. Weak sharp solutions of mixed variational inequalities in Banach spaces
    301 -- 310Wenjie Li, Shisheng Li, Qi Feng. Online batch scheduling with kind release times and incompatible families to minimize makespan
    311 -- 320Glaydston de Carvalho Bento, Orizon Pereira Ferreira, Valdinês Leite de Sousa Júnior. Proximal point method for a special class of nonconvex multiobjective optimization functions
    321 -- 334Alexandre D. Jesus, Luís Paquete, José Rui Figueira. Finding representations for an unconstrained bi-objective combinatorial optimization problem
    335 -- 346Rian Gabriel S. Pinheiro, Ivan C. Martins, Fábio Protti, Luiz Satoru Ochi. A matheuristic for the cell formation problem
    347 -- 365Jing Lu, Jianxiong Zhang, Qiao Zhang. Dynamic pricing for perishable items with costly price adjustments
    367 -- 373Gábor Wiener. Depth first search in claw-free graphs
    375 -- 386Jun Wang. A Stackelberg differential game for defence and economy
    387 -- 397Fahimeh Shamsaei, Claudio Telha, Mathieu Van Vyve. On the on-line maintenance scheduling problem
    399 -- 410Glaydston de Carvalho Bento, João X. da Cruz Neto, Paulo Sérgio Marques dos Santos, Simone do Rocio Senger de Souza. A weighting subgradient algorithm for multiobjective optimization
    411 -- 424Jingyong Tang, Jinchuan Zhou, Liang Fang. Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
    425 -- 434Manuel Radons. O(n) working precision inverses for symmetric tridiagonal Toeplitz matrices with O(1) floating point calculations

    Volume 12, Issue 1

    1 -- 0Pavlo A. Krokhmal, Oleg A. Prokopyev. Optimization Letters Best Paper Award for 2016
    3 -- 15Masoud Zarepisheh, Lei Xing, Yinyu Ye. A computation study on an integrated alternating direction method of multipliers for large scale optimization
    17 -- 33Radu Ioan Bot, Ernö Robert Csetnek, Nimit Nimana. Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
    35 -- 41Petra Weidner. Construction of functions with uniform sublevel sets
    43 -- 53Antonio Frangioni, Bernard Gendron, Enrico Gorgone. Dynamic smoothness parameter for fast gradient methods
    55 -- 62Huilan Chang, Hung-Lin Fu, ChiH-Huai Shih. Learning a hidden uniform hypergraph
    63 -- 71Federico Piazzon, Marco Vianello. A note on total degree polynomial optimization by Chebyshev grids
    73 -- 86Kai Li, Hui-juan Zhang, Ba-Yi Cheng, Panos M. Pardalos. Uniform parallel machine scheduling problems with fixed machine cost
    87 -- 102Q. L. Dong, H. B. Yuan, Y. J. Cho, Th. M. Rassias. Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
    103 -- 122Zhili Ge, Deren Han, Qin Ni, David Z. W. Wang. An operator splitting method for monotone variational inequalities with a new perturbation strategy
    123 -- 136M. X. You, S. J. Li. Nonlinear separation concerning E-optimal solution of constrained multi-objective optimization problems
    137 -- 154Manuel Ruiz Galán. Elementary convex techniques for equilibrium, minimax and variational problems
    155 -- 169Wei-An Chen, Zhen Zhu, Nan Kong. A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
    171 -- 185Janne Sorsa, Harri Ehtamo, Juha-Matti Kuusinen, Mirko Ruokokoski, Marja-Liisa Siikonen. Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control
    187 -- 202Pierre von Mouche, Willem Pijnappel. The Hotelling bi-matrix game
    203 -- 220Lina Mallozzi, Justo Puerto. The geometry of optimal partitions in location problems
    221 -- 234Eduardo Segredo, Ben Paechter, Carlos Segura, Carlos Ignacio Gonzalez-Vila. On the comparison of initialisation strategies in differential evolution for large scale optimisation
    runs on