default search action
Optimization Letters, Volume 13
Volume 13, Number 1, February 2019
- Pavlo A. Krokhmal, Oleg A. Prokopyev
:
Optimization Letters Best Paper Award for 2017. 1 - Lakmali Weerasena, Margaret M. Wiecek:
A tolerance function for the multiobjective set covering problem. 3-21 - Evgeni A. Nurminski:
A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence. 23-34 - Mounir Haddou, Tangi Migot
A generalized direction in interior point method for monotone linear complementarity problems. 35-53 - María Alonso, Elvira Hernández
Optimality conditions and minimax properties in set optimization. 55-68 - Arieh Gavious, Yizhaq Minchuk
Separating equilibria in auctions with two types of bidders. 69-79 - Fabián Díaz-Núñez, Nir Halman, Óscar C. Vásquez
The TV advertisements scheduling problem. 81-94 - Ubaldo M. García-Palomares
Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods. 95-111 - Nader Kanzi
Optimality conditions for semi-infinite programming problems involving generalized convexity. 113-126 - M. Moslemi, Behrouz Kheirfam:
Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function. 127-145 - S. Khoshkhabar-amiranloo:
Characterizations of generalized Levitin-Polyak well-posed set optimization problems. 147-161 - Nguyen Van Tuyen
A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization. 163-174 - Abdellah Bnouhachem, Themistocles M. Rassias:
A new descent alternating direction method with LQP regularization for the structured variational inequalities. 175-192 - Leonardo D. Secchin
An improved mixed-integer programming model for the double row layout of facilities. 193-199 - Lam Quoc Anh, Phan Quoc Khanh
Continuity of approximate solution maps of primal and dual vector equilibrium problems. 201-211 - Ioannis K. Argyros, Gilson N. Silva:
Extending the Kantorovich's theorem on Newton's method for solving strongly regular generalized equation. 213-226 - Vera Roshchina
The Demyanov-Ryabova conjecture is false. 227-234
Volume 13, Number 2, March 2019
- Gustavo Angulo
Matrices with lexicographically-ordered rows. 235-248 - Anatoly Zhigljavsky, Antanas Zilinskas
Selection of a covariance function for a Gaussian random field aimed for modeling global optimization problems. 249-259 - Maolin Che, Liqun Qi, Yimin Wei
Stochastic $$R_0$$ R 0 tensors to stochastic tensor complementarity problems. 261-279 - Mostafa Naghavi
Inverse optimization for multi-objective linear programming. 281-294 - María J. Cánovas
An approach to calmness of linear inequality systems from Farkas lemma. 295-307 - Ahmet Sahiner, Shehab A. Ibrahem:
A new global optimization technique by auxiliary function method in a directional search. 309-323 - Nguyen Dinh, Miguel A. Goberna
Convexity and closedness in stable robust duality. 325-339 - Yusa Matsuda, Satoshi Takahashi
A 4-approximation algorithm for k-prize collecting Steiner tree problems. 341-348 - C. L. Yao, Sheng-Jie Li:
Conjugate duality for constrained optimization via image space analysis and abstract convexity. 349-366 - Jungju Park, Jeonghoon Mo:
An efficient method for joint product line selection and pricing with fixed costs. 367-378 - Marco Casazza
New formulations for Variable Cost and Size Bin Packing Problems with Item Fragmentation. 379-398 - Hossein Mohebi, Morteza Sheikhsamani:
Characterizing nonconvex constrained best approximation using Robinson's constraint qualification. 399-417 - Huijuan Wang, Lidong Wu, Miltiades P. Pardalos, Hongwei Du, Bin Liu:
An efficient case for computing minimum linear arboricity with small maximum degree. 419-428 - Leo Liberti
A mathematical programming formulation for the Hartree-Fock problem on open-shell systems. 429-437 - Manuel Radons
A note on surjectivity of piecewise affine mappings. 439-443 - Dirk Briskorn
On approximating maximum covering cycles in undirected graphs. 445-448
Volume 13, Number 3, April 2019
- Panos M. Pardalos, Kok Lay Teo, Rentsen Enkhbat:
Preface: Special issue dedicated to the tenth international conference on optimization techniques and applications (ICOTA 10). 449-450 - Anatoly S. Antipin
Controlled dynamic model with boundary-value problem of minimizing a sensitivity function. 451-473 - Rentsen Enkhbat, Enkhbayar Jamsranjav
A note on maxmin problem. 475-483 - An Li
Optimal control of implicit control systems and its applications to differential complementarity problems. 485-504 - Huifang Wang, Lingchen Kong, Jiyuan Tao
The linearized alternating direction method of multipliers for sparse group LAD model. 505-525 - Lei Wang
Practical algorithm for stochastic optimal control problem about microbial fermentation in batch culture. 527-541 - Yue Shi, Zhiguo Feng, Ka Fai Cedric Yiu
A descent method for least absolute deviation lasso problems. 543-559 - Yanjun Jiang, Dachuan Xu
An approximation algorithm for the dynamic facility location problem with outliers. 561-571 - Lu Han, Dachuan Xu
A 5-approximation algorithm for the k-prize-collecting Steiner tree problem. 573-585 - S. Batbileg
A global optimization algorithm for solving a four-person game. 587-596 - Alexander S. Strekalovsky
Global optimality conditions and exact penalization. 597-615 - Hong Seng Sim, Wah June Leong
Gradient method with multiple damping for large-scale unconstrained optimization. 617-632 - Alexandr Yu. Gornov, Evgeniya A. Finkelstein
Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution. 633-643
Volume 13, Number 4, June 2019
- Julie Nutini, Mark Schmidt, Warren L. Hare:
"Active-set complexity" of proximal gradient: How long does it take to find the sparsity pattern? 645-655 - Jianqiang Cheng
Partial sample average approximation method for chance constrained problems. 657-672 - Claudia D'Ambrosio
Strengthening the sequential convex MINLP technique by perspective reformulations. 673-684 - Hongru Xu, Dong-Hui Li, Shuilian Xie
An equivalent tensor equation to the tensor complementarity problem with positive semi-definite Z-tensor. 685-694 - Gokhan Karakose
Optimal K-node disruption on a node-capacitated network. 695-715 - Hugo Raguet
A note on the forward-Douglas-Rachford splitting for monotone inclusion and convex optimization. 717-740 - Donghwan Lee, Jianghai Hu:
Sequential parametric convex approximation algorithm for bilinear matrix inequality problem. 741-759 - Hongwei Lin
A filled function which has the same local minimizer of the objective function. 761-776 - Xingju Cai:
A proximal point algorithm with asymmetric linear term. 777-793 - Yboon García, Marc Lassonde:
Limits of maximal monotone operators driven by their representative functions. 795-803 - Daoling Lin
The modified second APG method for DC optimization problems. 805-824 - Hüseyin Güden, Ertan Yakici
A branch and cut algorithm for the capacitated star-star telecommunication network problem. 825-836 - Zi Xu, Siqi Tao, Kaiyao Lou:
Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem. 837-845 - Simon Wessing:
Proper initialization is crucial for the Nelder-Mead simplex search. 847-856 - Adela Capata
Optimality conditions for ϵ -quasi solutions of optimization problems via ϵ -upper convexificators with applications. 857-873 - Miroslav Rada
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases. 875-890 - Zhe Hong, Guang-Ri Piao, Do Sang Kim:
On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives. 891-906 - Manzhan Gu, Xiwen Lu, Jinwei Gu:
An approximation algorithm for multi-agent scheduling on two uniform parallel machines. 907-933 - Zhaohua Gong, Chongyang Liu
Distributionally robust L1 -estimation in multiple linear regression. 935-947 - Long Zhang, Yuzhong Zhang, Donglei Du
Improved price of anarchy for machine scheduling games with coordination mechanisms. 949-959
Volume 13, Number 5, July 2019
- Akshay Agrawal, Steven Diamond, Stephen P. Boyd:
Disciplined geometric programming. 961-976 - Audrey DeVries
Convex hull representations of special monomials of binary variables. 977-992 - Kaarthik Sundar
Path planning for unmanned vehicles with localization constraints. 993-1009 - Iztok Fajfar
The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization. 1011-1025 - Nooshin Movahedian, S. Nobakhtian, M. Sarabadan:
Nonsmooth sparsity constrained optimization problems: optimality conditions. 1027-1038 - Mohamed Achache, Nesrine Tabchouche:
A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems. 1039-1057 - Zhe Hong, Kwan Deok Bae, Do Sang Kim:
Optimality conditions in convex optimization with locally Lipschitz constraints. 1059-1068 - Xiaojing Zhu, Chunyan Duan
On matrix exponentials and their approximations related to optimization on the Stiefel manifold. 1069-1083 - Pakkapon Preechasilp
A note on semicontinuity of the solution mapping for parametric set optimization problems. 1085-1094 - Ying Sun, Shaohua Pan, Shujun Bi:
Metric subregularity and/or calmness of the normal cone mapping to the p-order conic constraint system. 1095-1110 - Binghai Zhou, Tao Peng:
New single machine scheduling with nonnegative inventory constraints and discretely controllable processing times. 1111-1142 - João Xavier da Cruz Neto, Paulo Sérgio Marques dos Santos
On a Bregman regularized proximal point method for solving equilibrium problems. 1143-1155 - Mingwang Zhang, Beibei Yuan, Yiyuan Zhou, Xiaoyu Luo, Zhengwei Huang:
A primal-dual interior-point algorithm with arc-search for semidefinite programming. 1157-1175 - Volkan Cevher
On the linear convergence of the stochastic gradient method with constant step-size. 1177-1187 - Ou Sun, Neng Fan
The probabilistic and reliable connected power dominating set problems. 1189-1206 - René Henrion:
Boris S. Mordukhovich: Variational analysis and applications - Springer, Cham, 2018, 622 pp. 1207-1209
Volume 13, Number 6, September 2019
- Seyedmohammadhossein Hosseinian
Algorithms for the generalized independent set problem based on a quadratic optimization approach. 1211-1222 - Drew P. Kouri
Higher-moment buffered probability. 1223-1237 - Shu Tu, Boris Defourny
An active-set strategy to solve Markov decision processes with good-deal risk measure. 1239-1257 - David Huckleberry Gutman
Enhanced basic procedures for the projection and rescaling algorithm. 1259-1267 - Andrea Cristofari
On global minimizers of quadratic functions with cubic regularization. 1269-1283 - Caifang Wang:
Properties of subgradient projection iteration when applying to linear imaging system. 1285-1297 - Alfredo Marín, Mercedes Pelegrín:
A new lifting theorem for vertex packing. 1299-1312 - Yingjie Bi, Ao Tang
On upper bounding Shannon capacity of graph through generalized conic programming. 1313-1323 - Federico Piazzon, Marco Vianello:
Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies. 1325-1343 - Mohammed Lalou
A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs. 1345-1364 - Nadia S. Fazzio, María Laura Schuverdt:
Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems. 1365-1379 - Geir Nævdal
Positive bases with maximal cosine measure. 1381-1388 - Ziran Yin
Perturbation analysis of nonlinear semidefinite programming under Jacobian uniqueness conditions. 1389-1402 - Bismark Singh
Approximating two-stage chance-constrained programs with classical probability bounds. 1403-1416 - Marc Goerigk
Representative scenario construction and preprocessing for robust combinatorial optimization problems. 1417-1431 - Charles Audet
Dynamic improvements of static surrogates in direct search optimization. 1433-1447
Volume 13, Number 7, October 2019
- Claudia O. López
Packing a fixed number of identical circles in a circular container with circular prohibited areas. 1449-1468 - Peter Damaschke
Optimal partial clique edge covering guided by potential energy minimization. 1469-1481 - Jian-Xun Zhao, Song Wang:
A power penalty approach to a discretized obstacle problem with nonlinear constraints. 1483-1504 - Yoshihiro Kanno
Mixed-integer programming formulation of a data-driven solver in computational elasticity. 1505-1514 - Yotaro Takazawa
Approximation algorithms for the covering-type k-violation linear program. 1515-1521 - Gabriele Eichfelder
An algorithm for computing Fréchet means on the sphere. 1523-1533 - Junkee Jeon, Hyeng Keun Koo, Yong Hyun Shin
Ratcheting with a bliss level of consumption. 1535-1556 - Vittorio Latorre
Derivative free methodologies for circuit worst case analysis. 1557-1571 - Zhe Yang, Haiqun Zhang:
Essential stability of cooperative equilibria for population games. 1573-1582 - Frank J. Kampas, Ignacio Castillo
Optimized ellipse packings in regular polygons. 1583-1613 - Jing Zhou
A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints. 1615-1630 - Ming Jie Gao
Asymptotic behaviors of semidefinite programming with a covariance perturbation. 1631-1649 - Petra Weidner
A new tool for the investigation of extended real-valued functions. 1651-1661 - Yiwei Jiang, Ping Zhou, T. C. E. Cheng
Optimal online algorithms for MapReduce scheduling on two uniform machines. 1663-1676 - Xi Chen, Ji-hong Zhang, Xiao-song Ding, Tian Yang, Jing-yi Qian:
Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming. 1677-1692 - Eduardo Álvarez-Miranda
Mixed-integer programming approaches for the tree $$t^*$$ t ∗ -spanner problem. 1693-1709 - Drew P. Kouri
Correction to: Higher-moment buffered probability. 1711
Volume 13, Number 8, November 2019
- Alexander P. Afanasiev, Michael Yu. Khachay
Special issue dedicated to the 8th international conference on optimization and applications (OPTIMA 2017). 1713-1714 - Alexander P. Afanas'ev, Sergei M. Dzyuba
Optimal control of nonlinear systems with separated linear part via quadratic criteria. 1715-1725 - Alla F. Albu, Vladimir I. Zubov:
Identification of the thermal conductivity coefficient in two dimension case. 1727-1743 - Ewa M. Bednarczuk, Agnieszka Prusinska
Implicit function and tangent cone theorems for singular inclusions and applications to nonlinear programming. 1745-1755 - Milena Bieniek
Vendor and retailer managed consignment inventory with additive price-dependent demand. 1757-1771 - Petre Birtea
First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds. 1773-1791 - Kresimir Burazin, Darko Mitrovic:
Apriori estimates for fractional diffusion equation. 1793-1801 - Igor A. Bykadorov
Monopolistic competition with investments in productivity. 1803-1817 - Igor A. Bykadorov
Acceleration procedure for special classes of multi-extremal problems. 1819-1835 - Michael Yu. Khachay
Attainable accuracy guarantee for the k-medians clustering in [0, 1]. 1837-1853 - Dmitry V. Khlopin
On Tauberian theorem for stationary Nash equilibria. 1855-1870 - Vladimir E. Krivonozhko
Measuring the smoothness of the DEA frontier. 1871-1884 - Nevena Mijajlovic, Milojica Jacimovic, Muhammad Aslam Noor
Gradient-type projection methods for quasi-variational inequalities. 1885-1896 - Roman V. Plotnikov
VNDS for the min-power symmetric connectivity problem. 1897-1911 - Nikolay Pogodaev
Program strategies for a dynamic game in the space of measures. 1913-1925 - Artem V. Pyatkin
The maximum number of induced open triangles in graphs of a given order. 1927-1935 - N. O. Sedova
LMI and SDP technique for stability analysis of nonlinear delay systems subject to constraints. 1937-1952 - Stepan P. Sorokin
Numeric algorithm for optimal impulsive control based on feedback maximum principle. 1953-1967 - Vitaly Zhadan
Two-phase simplex method for linear semidefinite optimization. 1969-1984
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-12-02 21:16 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: