default search action
Optimization Letters, Volume 12
Volume 12, Number 1, January 2018
- Pavlo A. Krokhmal, Oleg A. Prokopyev
:
Optimization Letters Best Paper Award for 2016. 1 - Masoud Zarepisheh
A computation study on an integrated alternating direction method of multipliers for large scale optimization. 3-15 - Radu Ioan Bot, Ernö Robert Csetnek, Nimit Nimana
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data. 17-33 - Petra Weidner
Construction of functions with uniform sublevel sets. 35-41 - Antonio Frangioni
Dynamic smoothness parameter for fast gradient methods. 43-53 - Huilan Chang
Learning a hidden uniform hypergraph. 55-62 - Federico Piazzon, Marco Vianello:
A note on total degree polynomial optimization by Chebyshev grids. 63-71 - Kai Li, Hui-Juan Zhang, Bayi Cheng, Panos M. Pardalos:
Uniform parallel machine scheduling problems with fixed machine cost. 73-86 - Qiao-Li Dong, H. B. Yuan, Y. J. Cho, Themistocles M. Rassias:
Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings. 87-102 - Zhili Ge, Deren Han, Qin Ni, David Z. W. Wang:
An operator splitting method for monotone variational inequalities with a new perturbation strategy. 103-122 - Manxue You
Nonlinear separation concerning E-optimal solution of constrained multi-objective optimization problems. 123-136 - Manuel Ruiz Galán
Elementary convex techniques for equilibrium, minimax and variational problems. 137-154 - Wei-An Chen, Zhen Zhu, Nan Kong:
A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs. 155-169 - Janne Sorsa
Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control. 171-185 - Pierre von Mouche, Willem Pijnappel:
The Hotelling bi-matrix game. 187-202 - Lina Mallozzi
The geometry of optimal partitions in location problems. 203-220 - Eduardo Segredo
On the comparison of initialisation strategies in differential evolution for large scale optimisation. 221-234
Volume 12, Number 2, March 2018
- Maxence Delorme
BPPLIB: a library for bin packing and cutting stock problems. 235-250 - Ge Yu, Sheldon H. Jacobson
Online C-benevolent job scheduling on multiple machines. 251-263 - Dakui Jiang, Jiayin Tan:
Scheduling with job delivery coordination on single machine. 265-272 - Giuseppe Caristi, Nader Kanzi
On gap functions for nonsmooth multiobjective optimization problems. 273-286 - Hui Huang
Weak sharp solutions of mixed variational inequalities in Banach spaces. 287-299 - Wenjie Li, Shisheng Li, Qi Feng:
Online batch scheduling with kind release times and incompatible families to minimize makespan. 301-310 - Glaydston de Carvalho Bento, Orizon Pereira Ferreira
Proximal point method for a special class of nonconvex multiobjective optimization functions. 311-320 - Alexandre D. Jesus
Finding representations for an unconstrained bi-objective combinatorial optimization problem. 321-334 - Rian Gabriel S. Pinheiro
A matheuristic for the cell formation problem. 335-346 - Jing Lu, Jianxiong Zhang
Dynamic pricing for perishable items with costly price adjustments. 347-365 - Gábor Wiener
Depth first search in claw-free graphs. 367-373 - Jun Wang:
A Stackelberg differential game for defence and economy. 375-386 - Fahimeh Shamsaei, Claudio Telha, Mathieu Van Vyve
On the on-line maintenance scheduling problem. 387-397 - Glaydston de Carvalho Bento, João Xavier da Cruz Neto, Paulo Sérgio Marques dos Santos
A weighting subgradient algorithm for multiobjective optimization. 399-410 - Jingyong Tang, Jinchuan Zhou, Liang Fang:
Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP. 411-424 - Manuel Radons
O(n) working precision inverses for symmetric tridiagonal Toeplitz matrices with O(1) floating point calculations. 425-434
Volume 12, Number 3, May 2018
- Milan Korda, Didier Henrion
Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets. 435-442 - Francesco Carrabs
On the complexity of rainbow spanning forest problem. 443-454 - Nguyen Mau Nam, Wondi Geremew, Samuel E. Reynolds
Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering. 455-473 - Markó Horváth
Multi-criteria approximation schemes for the resource constrained shortest path problem. 475-483 - Natasa Krejic, Natasa Krklec Jerinkic, Andrea Roznjik
Variable sample size method for equality constrained optimization problems. 485-497 - Jaehyun Park, Stephen P. Boyd:
A semidefinite programming method for integer convex quadratic minimization. 499-518 - Shuqin Sun, Yiran He:
Exact characterization for subdifferentials of a special optimal value function. 519-534 - Ton Kloks, Yue-Li Wang:
On retracts, absolute retracts, and foldings in cographs. 535-549 - Dang Van Hieu:
Projected subgradient algorithms on systems of equilibrium problems. 551-566 - Bruno C. S. Nogueira
A hybrid iterated local search heuristic for the maximum weight independent set problem. 567-583 - János D. Pintér, Frank J. Kampas, Ignacio Castillo
Globally optimized packings of non-uniform size spheres in ℝd: a computational study. 585-613 - César Gutiérrez
A note on existence of weak efficient solutions for vector equilibrium problems. 615-623 - Lu Han, Dachuan Xu
Approximation algorithms for the robust facility leasing problem. 625-637 - R. Balaji, K. Palpandi
Positive definite and Gram tensor complementarity problems. 639-648 - Dorit S. Hochbaum, Asaf Levin
Weighted matching with pair restrictions. 649-659 - Mustafa Ç. Pinar:
On explicit solutions of a two-echelon supply chain coordination game. 661-673
Volume 12, Number 4, June 2018
- Charles Audet
Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm. 675-689 - Claudia D'Ambrosio, Fabio Furini
On the Product Knapsack Problem. 691-712 - Bjarne A. Grimstad
A MIQCP formulation for B-spline constraints. 713-725 - Nélio Henderson, Marroni de Sá Rêgo
Testing the topographical global initialization strategy in the framework of an unconstrained optimization method. 727-741 - Marco César Goldbarg, Elizabeth Ferreira Gouvea Goldbarg
Integer programming models and linearizations for the traveling car renter problem. 743-761 - Jinjiang Yuan
Complexities of four problems on two-agent scheduling. 763-780 - Yaguang Yang, Makoto Yamashita:
An arc-search $${\mathcal {O}}(nL)$$ O ( n L ) infeasible-interior-point algorithm for linear programming. 781-798 - Nguyen Thanh Qui, Hoang Ngoc Tuan:
Stability of generalized equations under nonlinear perturbations. 799-815 - Aviv Gibali, Li-Wei Liu, Yu-Chao Tang:
Note on the modified relaxation CQ algorithm for the split feasibility problem. 817-830 - Samir Adly
On semicoercive sweeping process with velocity constraint. 831-843 - Hongwei Liu, Zexian Liu, Xiaoliang Dong:
A new adaptive Barzilai and Borwein method for unconstrained optimization. 845-873 - Zuping Wu, Yong Xia, Shu Wang:
Approximating the weighted maximin dispersion problem over an $$\ell _p$$ ℓ p -ball: SDP relaxation is misleading. 875-883 - S. Mirzadeh, H. Mohebi:
Global minimization of the difference of increasing co-radiant and quasi-concave functions. 885-902 - Sophie Jacquin, Fanny Dufossé, Laetitia Jourdan
An exact algorithm for the bi-objective timing problem. 903-914 - Sorin-Mihai Grad
Characterizations via linear scalarization of minimal and properly minimal elements. 915-922 - Marius Durea
Optimality conditions and a barrier method in optimization with convex geometric constraint. 923-931
Volume 12, Number 5, July 2018
- Takahito Kuno
Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm. 933-943 - Andrea Lodi
Experiments on virtual private network design with concave capacity costs. 945-957 - Ning Zhang
Two-stage robust mixed integer programming problem with objective uncertainty. 959-969 - Khanh Duy Pham, Nhut Minh Bùi
Error bounds for strongly monotone and Lipschitz continuous variational inequalities. 971-984 - Cheng Lu, Zhibin Deng
DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs. 985-996 - Pedro Jorge Sousa dos Santos
A proximal Newton-type method for equilibrium problems. 997-1009 - Peter Frankl:
An exact result for (0, ± 1)-vectors. 1011-1017 - Matthew K. Tam
Algorithms based on unions of nonexpansive maps. 1019-1027 - Peter Fernandes Wanke
A DDF based model for efficiency evaluation in two-stage DEA. 1029-1044 - Nguyen Nang Tam, Tran Van Nghi
On the solution existence and stability of quadratically constrained nonconvex quadratic programs. 1045-1063 - Xiucui Guan, Panos M. Pardalos, Binwu Zhang:
Inverse max+sum spanning tree problem under weighted l1 norm by modifying the sum-cost vector. 1065-1077 - Mousaab Bouafia, Djamel Benterki, Adnan Yassine:
An efficient parameterized logarithmic kernel function for linear optimization. 1079-1097 - Zsolt Darvay
New method for determining search directions for interior-point algorithms in linear optimization. 1099-1116 - Zhou Wei, Jen-Chih Yao:
On Constraint qualifications of a nonconvex inequality. 1117-1139 - Joachim Gwinner
An optimization approach to parameter identification in variational inequalities of second kind. 1141-1154 - Dragan Jukic
An elementary proof of the quadratic envelope characterization of zero-derivative points. 1155-1156
Volume 12, Number 6, August 2018
- Kok Lay Teo, Adil M. Bagirov
Preface of the special issue: the 6th International Conference on Optimization and Control with Applications (6th OCA). 1157-1159 - Song Wang
An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering. 1161-1178 - Jueyou Li, Guoquan Li, Zhiyou Wu, Changzhi Wu
Stochastic mirror descent method for distributed multi-agent optimization. 1179-1197 - Qingling Zhang, Jinghao Li, Zhongyan Song:
Sliding mode control for discrete-time descriptor Markovian jump systems with two Markov chains. 1199-1213 - Jianping Liu, Shunfu Jin
A novel adaptive spectrum reservation strategy in CRNs and its performance optimization. 1215-1235 - Sarah Yini Gao, Jie Sun
A semi-infinite programming approach to two-stage stochastic linear programs with high-order moment constraints. 1237-1247 - Chongyang Liu
Bi-objective dynamic optimization of a nonlinear time-delay system in microbial batch process. 1249-1264 - G. H. Li, Shengjie Li:
Saddle points and gap functions for weak generalized Ky Fan inequalities. 1265-1280 - Yuan Zhao, Wuyi Yue:
Performance analysis and optimization of cognitive radio networks with retransmission control. 1281-1300 - Yan Wang, Aimin Song, Lei Wang
Maximum principle via Malliavin calculus for regular-singular stochastic differential games. 1301-1314 - Ke-wei Ding, Ming-hui Wang, Nan-Jing Huang:
Distributionally robust chance constrained problem under interval distribution information. 1315-1328 - Zhi-Ang Zhou, Xin-Min Yang, Xuan Wan:
The semi-E cone convex set-valued map and its applications. 1329-1337 - Zai Yun Peng, Xiao-Bing Li, Xian-Jun Long, Xiao-Dong Fan:
Painlevé-Kuratowski stability of approximate efficient solutions for perturbed semi-infinite vector optimization problems. 1339-1356 - Zhong-bao Wang, Zi-li Chen, Zhang-you Chen, Sisheng Yao:
Lagrangian methods for optimal control problems governed by a mixed quasi-variational inequality. 1357-1371 - Bin Li, Zhi Guo Feng, Hai Huyen Dam, Antonio Cantoni:
A reduced complexity zero-forcing beamformer design for multiuser MIMO systems. 1373-1386 - Xiao-Bing Li, Song Wang
Characterizations of robust solution set of convex programs with uncertain data. 1387-1402 - Xiang-Kai Sun, Liping Tang, Xian-Jun Long, Minghua Li:
Some dual characterizations of Farkas-type results for fractional programming problems. 1403-1420 - Li 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. 1421-1441 - Mohamed A. Tawhid
Complementarity problems over a hypermatrix (tensor) set. 1443-1454 - Guoquan Li, Qiang Long, Lin Jiang:
Global optimality conditions for fixed charge quadratic programs. 1455-1464
Volume 12, Number 7, October 2018
- Heinz H. Bauschke
The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings. 1465-1474 - James Saunderson
A spectrahedral representation of the first derivative relaxation of the positive semidefinite cone. 1475-1486 - Maria C. Jansen, Osman Y. Özaltin
Optimal production in a competitive market under yield uncertainty. 1487-1502 - Yiling Zhang
Solving 0-1 semidefinite programs for distributionally robust allocation of surgery blocks. 1503-1521 - André B. Chassein, Marc Goerigk
On scenario aggregation to approximate robust combinatorial optimization problems. 1523-1533 - Stefano Sebastio
A green policy to schedule tasks in a distributed cloud. 1535-1551 - Theo Karaboghossian, Michele Zito:
Easy knapsacks and the complexity of energy allocation problems in the smart grid. 1553-1568 - Thi Hoai Pham
Monotonic optimization for sensor cover energy problem. 1569-1587 - Jianchao Bai
A parameterized proximal point algorithm for separable convex optimization. 1589-1608 - Bayi Cheng, Jun Pei, Kai Li, Panos M. Pardalos:
Integrated scheduling of production and distribution for manufacturers with parallel batching facilities. 1609-1623 - Nguyen Thi Thu Ha, Jean-Jacques Strodiot
On the global exponential stability of a projected dynamical system for strongly pseudomonotone variational inequalities. 1625-1638 - Hao Zhang
A new regularized quasi-Newton method for unconstrained optimization. 1639-1658 - Marco Vianello:
Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization. 1659-1667 - Eduardo Álvarez-Miranda
An exact solution framework for the minimum cost dominating tree problem. 1669-1681 - Makoto Yamashita, Tim J. Mullin, Sena Safarina
An efficient second-order cone programming approach for optimal selection in tree breeding. 1683-1697 - Linas Stripinis
Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT. 1699-1712
Volume 12, Number 8, December 2018
- Frank E. Curtis
Concise complexity analyses for trust region methods. 1713-1724 - Marco Locatelli:
Convex envelopes of separable functions over regions defined by separable functions of the same type. 1725-1739 - Alberto Franzin
Effect of transformations of numerical parameters in automatic algorithm configuration. 1741-1753 - Juan Parra Galvez
Application of optimization for solving a sawing stock problem with a cant sawing pattern. 1755-1772 - Abderrahim Hantoute, Emilio Vilches
Lyapunov pairs for perturbed sweeping processes. 1773-1787 - Boualem Alleche, Vicentiu D. Radulescu
Further on set-valued equilibrium problems in the pseudo-monotone case and applications to Browder variational inclusions. 1789-1810 - Manlio Gaudioso, Giovanni Giallombardo
A savings-based model for two-shipper cooperative routing. 1811-1824 - Alexander V. Fominyh
Application of the hypodifferential descent method to the problem of constructing an optimal control. 1825-1839 - Margarita Domènech
Semivalues: weighting coefficients and allocations on unanimity games. 1841-1854 - Ido Halperin
Optimal control synthesis for the constrained bilinear biquadratic regulator problem. 1855-1870 - Qiao-Li Dong, Yeol Je Cho, Themistocles M. Rassias:
The projection and contraction methods for finding common solutions to variational inequality problems. 1871-1896 - Giandomenico Mastroeni
Quasi-variational equilibrium models for network flow problems. 1897-1910 - Min Li:
A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method. 1911-1927 - C. L. Yao, Shengjie Li:
Efficient and weakly efficient solutions for the vector topical optimization. 1929-1945 - Esmaeel Moradi, Balabhaskar Balasundaram
Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts. 1947-1957 - Yajun Lu
Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts. 1959-1969 - Valentin V. Gorokhovik
Saddle representations of positively homogeneous functions by linear functions. 1971-1980
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: