dblp: Optimization Letters, Volume 14 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• 

• 

• 

• 

• 
  jump to

  • Number 1
  • Number 2
  • Number 3
  • Number 4
  • Number 5
  • Number 6
  • Number 7
  • Number 8

• 

• > Home > Journals > Optimization Letters

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 14, Number 1, February 2020

• 
  • 
  • 
  • 
  • 
    Pavlo A. Krokhmal, Oleg A. Prokopyev:
    Optimization Letters Best Paper Award for 2018. 1
• 
  • 
  • 
  • 
  • 
    Charles Audet, Pascal Côté, Catherine Poissant, Christophe Tribes:
    Monotonic grey box direct search optimization. 3-18
• 
  • 
  • 
  • 
  • 
    Manlio Gaudioso, Enrico Gorgone, Jean-Baptiste Hiriart-Urruty:
    Feature selection in SVM via polyhedral k-norm. 19-36
• 
  • 
  • 
  • 
  • 
    Emily A. Heath, John E. Mitchell, Thomas C. Sharkey:
    Scheduling of tasks with effectiveness precedence constraints. 37-49
• 
  • 
  • 
  • 
  • 
    Riccardo Moriconi, K. S. Sesh Kumar, Marc Peter Deisenroth:
    High-dimensional Bayesian optimization with projections using quantile Gaussian processes. 51-64
• 
  • 
  • 
  • 
  • 
    Laleh Eslamizadeh, Eskandar Naraghirad:
    Existence of solutions of set-valued equilibrium problems in topological vector spaces with applications. 65-83
• 
  • 
  • 
  • 
  • 
    Massimiliano Caramia, Stefano Giordani:
    Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach. 85-99
• 
  • 
  • 
  • 
  • 
    Seulgi Joung, Kyungsik Lee:
    Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity. 101-113
• 
  • 
  • 
  • 
  • 
    Duong Viet Thong, Dang Van Hieu, Themistocles M. Rassias:
    Self adaptive inertial subgradient extragradient algorithms for solving pseudomonotone variational inequality problems. 115-144
• 
  • 
  • 
  • 
  • 
    Shu Liang, Le Yi Wang, George Yin:
    Fractional differential equation approach for convex optimization with convergence rate analysis. 145-155
• 
  • 
  • 
  • 
  • 
    Mohammad Hossein Alizadeh:
    On generalized convex functions and generalized subdifferential. 157-169
• 
  • 
  • 
  • 
  • 
    Amin Hosseininasab, Fatma Gzara:
    Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem. 171-193
• 
  • 
  • 
  • 
  • 
    Kazuo Murota, Akihisa Tamura:
    Integrality of subgradients and biconjugates of integrally convex functions. 195-208
• 
  • 
  • 
  • 
  • 
    Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou:
    Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach. 209-227
• 
  • 
  • 
  • 
  • 
    Patrick R. Johnstone, Jonathan Eckstein:
    Projective splitting with forward steps only requires continuity. 229-247
• 
  • 
  • 
  • 
  • 
    Yuezhong Zhang, Lihang Hou, Bo Hou, Weili Wu, Ding-Zhu Du, Suogang Gao:
    On the metric dimension of the folded n-cube. 249-257
• 
  • 
  • 
  • 
  • 
    James M. Calvin, Antanas Zilinskas:
    On efficiency of a single variable bi-objective optimization algorithm. 259-267

Volume 14, Number 2, March 2020

Distances in optimization and graphs dedicated to the memory of Michel Deza

• 
  • 
  • 
  • 
  • 
    Antonio Mucherino, Carlile Lavor:
    Preface: Special issue on distances in optimization and graphs dedicated to the memory of Michel Deza. 269-271
• 
  • 
  • 
  • 
  • 
    Michel Deza, Mathieu Dutour Sikiric:
    Generalized cut and metric polytopes of graphs and simplicial complexes. 273-289
• 
  • 
  • 
  • 
  • 
    Pavel Chebotarev, Elena Deza:
    Hitting time quasi-metric and its forest representation. 291-307
• 
  • 
  • 
  • 
  • 
    Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin:
    Distance between vertices of lattice polytopes. 309-326
• 
  • 
  • 
  • 
  • 
    Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin, Carlos Aníbal Suárez:
    Correction to: Distance between vertices of lattice polytopes. 327-328
• 
  • 
  • 
  • 
  • 
    Michel Petitjean:
    Chirality in metric spaces. 329-338
• 
  • 
  • 
  • 
  • 
    Monique Laurent, Shin-ichi Tanigawa:
    Perfect elimination orderings for symmetric matrices. 339-353
• 
  • 
  • 
  • 
  • 
    Alain Hertz:
    An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes. 355-367
• 
  • 
  • 
  • 
  • 
    Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
    Modelling and solving the perfect edge domination problem. 369-394
• 
  • 
  • 
  • 
  • 
    Juan Carlos Figueroa-García, Miguel Alberto Melgarejo-Rey, Germán Jairo Hernández-Pérez:
    Representation of the Minkowski metric as a fuzzy set. 395-408
• 
  • 
  • 
  • 
  • 
    Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske:
    On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. 409-415
• 
  • 
  • 
  • 
  • 
    Jon Lee, Leo Liberti:
    On an SDP relaxation for kissing number. 417-422
• 
  • 
  • 
  • 
  • 
    Douglas Soares Gonçalves:
    A least-squares approach for discretizable distance geometry problems with inexact distances. 423-437
• 
  • 
  • 
  • 
  • 
    Jérémy Omer, Douglas Soares Gonçalves:
    An integer programming approach for the search of discretization orders in distance geometry problems. 439-452
• 
  • 
  • 
  • 
  • 
    Alain Franc, Pierre Blanchard, Olivier Coulaud:
    Nonlinear mapping and distance geometry. 453-467
• 
  • 
  • 
  • 
  • 
    Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino:
    The K-discretization and K-incident graphs for discretizable Distance Geometry. 469-482
• 
  • 
  • 
  • 
  • 
    Luiz Leduíno de Salles Neto, Carlile Lavor, Weldon A. Lodwick:
    A constrained interval approach to the generalized distance geometry problem. 483-492
• 
  • 
  • 
  • 
  • 
    Antonio Mucherino, Jérémy Omer, Ludovic Hoyet, Paolo Robuffo Giordano, Franck Multon:
    An application-based characterization of dynamical distance geometry problems. 493-507

Volume 14, Number 3, April 2020

• 
  • 
  • 
  • 
  • 
    Wim van Ackooij, Welington de Oliveira:
    Some brief observations in minimizing the sum of locally Lipschitzian functions. 509-520
• 
  • 
  • 
  • 
  • 
    Sumalee Sangamuang, Pruet Boonma, Juggapong Natwichai, Wanpracha Art Chaovalitwongse:
    Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking. 521-533
• 
  • 
  • 
  • 
  • 
    Guido Cocchi, Tommaso Levato, Giampaolo Liuzzi, Marco Sciandrone:
    A concave optimization-based approach for sparse multiobjective programming. 535-556
• 
  • 
  • 
  • 
  • 
    Anton V. Eremeev, Mikhail Y. Kovalyov, Pavel M. Kuznetsov:
    Lot-size scheduling of a single product on unrelated parallel machines. 557-568
• 
  • 
  • 
  • 
  • 
    Mei-Jia Yang, Yong Xia:
    On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint. 569-578
• 
  • 
  • 
  • 
  • 
    Ramon Faganello Fachini, Vinícius Amaral Armentano:
    Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows. 579-609
• 
  • 
  • 
  • 
  • 
    Shan Jiang, Shu-Cherng Fang, Tiantian Nie, Qi An:
    Structured linear reformulation of binary quadratically constrained quadratic programs. 611-636
• 
  • 
  • 
  • 
  • 
    Guo-ji Tang, Yan-shu Li:
    Existence of solutions for mixed variational inequalities with perturbation in Banach spaces. 637-651
• 
  • 
  • 
  • 
  • 
    Noureddine Khimoum, Mohand Ouamer Bibi:
    Primal-dual method for solving a linear-quadratic multi-input optimal control problem. 653-669
• 
  • 
  • 
  • 
  • 
    Eduardo Lalla-Ruiz, Stefan Voß:
    A POPMUSIC approach for the Multi-Depot Cumulative Capacitated Vehicle Routing Problem. 671-691
• 
  • 
  • 
  • 
  • 
    Peiping Shen, Bingdi Huang:
    Global algorithm for solving linear multiplicative programming problems. 693-710
• 
  • 
  • 
  • 
  • 
    Qamrul Hasan Ansari, Feeroz Babu:
    Existence and boundedness of solutions to inclusion problems for maximal monotone vector fields in Hadamard manifolds. 711-727
• 
  • 
  • 
  • 
  • 
    Baha Alzalg:
    A logarithmic barrier interior-point method based on majorant functions for second-order cone programming. 729-746
• 
  • 
  • 
  • 
  • 
    Kris Boudt, Chunlin Wan:
    The effect of velocity sparsity on the performance of cardinality constrained particle swarm optimization. 747-758
• 
  • 
  • 
  • 
  • 
    Marius Durea, Radu Strugariu:
    A barrier method in convex vector optimization with generalized inequality constraints. 759-769
• 
  • 
  • 
  • 
  • 
    Baruch Mor, Gur Mosheiov:
    Minimizing total load on parallel machines with linear deterioration. 771-779
• 
  • 
  • 
  • 
  • 
    Mahdi Takalloo, Changhyun Kwon:
    Sensitivity of wardrop equilibria: revisited. 781-796

Volume 14, Number 4, June 2020

Special Issue in Memory of Professor Christodoulos A. Floudas

• 
  • 
  • 
  • 
  • 
    Fani Boukouvala, Chrysanthos E. Gounaris:
    A preface to the special issue in memory of Professor Christodoulos A. Floudas. 797-800
• 
  • 
  • 
  • 
  • 
    Francesco Ceccon, John D. Siirola, Ruth Misener:
    SUSPECT: MINLP special structure detector for Pyomo. 801-814
• 
  • 
  • 
  • 
  • 
    Ernesto G. Birgin, John Lenon Cardoso Gardenghi, José Mario Martínez, Sandra A. Santos:
    On the use of third-order models with fourth-order regularization for unconstrained optimization. 815-838
• 
  • 
  • 
  • 
  • 
    Dimitris Bertsimas, Nataly Youssef:
    Stochastic optimization in supply chain networks: averaging robust solutions. 839-855
• 
  • 
  • 
  • 
  • 
    Min Kong, Xinbao Liu, Jun Pei, Zhiping Zhou, Panos M. Pardalos:
    Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine. 857-871
• 
  • 
  • 
  • 
  • 
    Styliani Avraamidou, Efstratios N. Pistikopoulos:
    Adjustable robust optimization through multi-parametric programming. 873-887
• 
  • 
  • 
  • 
  • 
    Michael J. Risbeck, Christos T. Maravelias, James B. Rawlings, Robert D. Turney:
    Mixed-integer optimization methods for online scheduling in large-scale HVAC systems. 889-924
• 
  • 
  • 
  • 
  • 
    Chrysanthos E. Gounaris, Daniel R. Schmidt:
    Generalized Hose uncertainty in single-commodity robust network design. 925-944
• 
  • 
  • 
  • 
  • 
    Yuan Yuan, Zukui Li, Biao Huang:
    Oil sands extraction plant debottlenecking: an optimization approach. 945-957
• 
  • 
  • 
  • 
  • 
    Atharv Bhosekar, Marianthi Ierapetritou:
    A discontinuous derivative-free optimization framework for multi-enterprise supply chain. 959-988
• 
  • 
  • 
  • 
  • 
    Sun Hye Kim, Fani Boukouvala:
    Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques. 989-1010
• 
  • 
  • 
  • 
  • 
    Ishan Bajaj, M. M. Faruque Hasan:
    Deterministic global derivative-free optimization of black-box problems with bounded Hessian. 1011-1026

Volume 14, Number 5, July 2020

• 
  • 
  • 
  • 
  • 
    Angeles Martinez, Federico Piazzon, Alvise Sommariva, Marco Vianello:
    Quadrature-based polynomial optimization. 1027-1036
• 
  • 
  • 
  • 
  • 
    Guanglin Xu, Alexander Semenov, Maciej Rysz:
    An integer programming formulation of the key management problem in wireless sensor networks. 1037-1051
• 
  • 
  • 
  • 
  • 
    Mounir Haddou, Tangi Migot:
    A smoothing method for sparse optimization over convex sets. 1053-1069
• 
  • 
  • 
  • 
  • 
    Cesare Molinari, Juan Peypouquet, Fernando Roldán:
    Alternating forward-backward splitting for linearly constrained optimization problems. 1071-1088
• 
  • 
  • 
  • 
  • 
    La Huang, Jiawei Chen:
    Weighted robust optimality of convex optimization problems with data uncertainty. 1089-1105
• 
  • 
  • 
  • 
  • 
    Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
    A non-triangular hub location problem. 1107-1126
• 
  • 
  • 
  • 
  • 
    Nithirat Sisarat, Rabian Wangkeeree:
    Characterizing the solution set of convex optimization problems without convexity of constraints. 1127-1144
• 
  • 
  • 
  • 
  • 
    Mohammad A. Raayatpanah, Hossein Moosaei, Panos M. Pardalos:
    Absolute value equations with uncertain data. 1145-1156
• 
  • 
  • 
  • 
  • 
    Duong Viet Thong, Nguyen The Vinh, Yeol Je Cho:
    A strong convergence theorem for Tseng's extragradient method for solving variational inequality problems. 1157-1175
• 
  • 
  • 
  • 
  • 
    Trinh Ngoc Hai:
    On gradient projection methods for strongly pseudomonotone variational inequalities without Lipschitz continuity. 1177-1191
• 
  • 
  • 
  • 
  • 
    Minh N. Dao, Hung M. Phan:
    Computing the resolvent of the sum of operators with application to best approximation problems. 1193-1205
• 
  • 
  • 
  • 
  • 
    Roberto Tadei, Guido Perboli, Daniele Manerba:
    The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities. 1207-1218
• 
  • 
  • 
  • 
  • 
    Ondrej Osicka, Mario Guajardo, Kurt Jörnsten:
    Cooperation of customers in traveling salesman problems with profits. 1219-1233
• 
  • 
  • 
  • 
  • 
    Yanjun Jiang, Yishui Wang, Dachuan Xu, Ruiqi Yang, Yong Zhang:
    Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint. 1235-1248
• 
  • 
  • 
  • 
  • 
    Zhiping Chen, Jie Jiang:
    Quantitative stability of fully random two-stage stochastic programs with mixed-integer recourse. 1249-1264
• 
  • 
  • 
  • 
  • 
    Amir Ahmadi-Javid, Nasrin Ramshe:
    Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application. 1265-1285
• 
  • 
  • 
  • 
  • 
    Amir Ahmadi-Javid, Nasrin Ramshe:
    Correction to: Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application. 1287

Volume 14, Number 6, September 2020

• 
  • 
  • 
  • 
  • 
    Jonathan Eckstein:
    Deriving solution value bounds from the ADMM. 1289-1303
• 
  • 
  • 
  • 
  • 
    Warren L. Hare, Gabriel Jarry-Bolduc:
    A deterministic algorithm to compute the cosine measure of a finite positive spanning set. 1305-1316
• 
  • 
  • 
  • 
  • 
    Dmitry B. Mokeev, Dmitriy S. Malyshev:
    A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs. 1317-1322
• 
  • 
  • 
  • 
  • 
    Trivikram Dokka, Marc Goerigk, Rahul Roy:
    Mixed uncertainty sets for robust combinatorial optimization. 1323-1337
• 
  • 
  • 
  • 
  • 
    Pedro J. Villasana T., Stanislaw Gorlow, Arvind T. Hariraman:
    Multiplicative updates for convolutional NMF under β-divergence. 1339-1352
• 
  • 
  • 
  • 
  • 
    Abdellah Bnouhachem, Themistocles M. Rassias:
    On descent alternating direction method with LQP regularization for the structured variational inequalities. 1353-1369
• 
  • 
  • 
  • 
  • 
    Shinya Fujita:
    Optimal proper connection of graphs. 1371-1380
• 
  • 
  • 
  • 
  • 
    Nazih Abderrazzak Gadhi, Stephan Dempe, Mohammed El Idrissi:
    New optimality conditions for bilevel programs by using an exact separation principle. 1381-1392
• 
  • 
  • 
  • 
  • 
    Xide Zhu, Peijun Guo:
    Single-level reformulations of a specific non-smooth bilevel programming problem and their applications. 1393-1406
• 
  • 
  • 
  • 
  • 
    Gabriel Jarry-Bolduc, Patrick Nadeau, Shambhavi Singh:
    Uniform simplex of an arbitrary orientation. 1407-1417
• 
  • 
  • 
  • 
  • 
    Kai Zhang, Xiaoqi Yang:
    A power penalty method for discrete HJB equations. 1419-1433
• 
  • 
  • 
  • 
  • 
    Maryam Yashtini:
    Euler's elastica-based algorithm for Parallel MRI reconstruction using SENSitivity Encoding. 1435-1458
• 
  • 
  • 
  • 
  • 
    Alexander E. I. Brownlee, Jerry Swan, Richard Senington, Zoltan A. Kocsis:
    Conflict-free routing of multi-stop warehouse trucks. 1459-1470
• 
  • 
  • 
  • 
  • 
    Joel Chacón Castillo, Carlos Segura:
    Differential evolution with enhanced diversity maintenance. 1471-1490
• 
  • 
  • 
  • 
  • 
    Mehmet Önal, O. Erhun Kundakcioglu, Smita Jain:
    An EOQ model with deteriorating items and self-selection constraints. 1491-1518
• 
  • 
  • 
  • 
  • 
    Rovshan A. Bandaliyev, Ilgar G. Mamedov, Misir J. Mardanov, Telman K. Melikov:
    Fractional optimal control problem for ordinary differential equation in weighted Lebesgue spaces. 1519-1532
• 
  • 
  • 
  • 
  • 
    Bismark Singh:
    Fairness criteria for allocating scarce resources. 1533-1541
• 
  • 
  • 
  • 
  • 
    Ludwig Kampel, Manuel Leithner, Dimitris E. Simos:
    Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm. 1543-1556
• 
  • 
  • 
  • 
  • 
    Amit Verma, Mark W. Lewis:
    Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions. 1557-1569
• 
  • 
  • 
  • 
  • 
    Jing Wang, Zheng-Hai Huang, Yang Xu:
    Existence and uniqueness of solutions of the generalized polynomial variational inequality. 1571-1582
• 
  • 
  • 
  • 
  • 
    Youngsuk Park, Ernest K. Ryu:
    Linear convergence of cyclic SAGA. 1583-1598
• 
  • 
  • 
  • 
  • 
    Yule Zhang, Jia Wu, Liwei Zhang:
    The rate of convergence of proximal method of multipliers for equality constrained optimization problems. 1599-1613

Volume 14, Number 7, October 2020

• 
  • 
  • 
  • 
  • 
    Andrzej Ruszczynski:
    Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization. 1615-1625
• 
  • 
  • 
  • 
  • 
    Archis Ghate:
    Robust continuous linear programs. 1627-1642
• 
  • 
  • 
  • 
  • 
    Akshay Agrawal, Stephen P. Boyd:
    Disciplined quasiconvex programming. 1643-1657
• 
  • 
  • 
  • 
  • 
    Charis Ntakolia, Hernan Caceres, John Coletsos:
    A dynamic integer programming approach for free flight air traffic management (ATM) scenario with 4D-trajectories and energy efficiency aspects. 1659-1680
• 
  • 
  • 
  • 
  • 
    Shi-Sheng Li, Ren-Xia Chen:
    Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties. 1681-1699
• 
  • 
  • 
  • 
  • 
    Zhihao Chen, Zhao Zhang, Yingli Ran, Yishuo Shi, Ding-Zhu Du:
    Data mule scheduling on a path with handling time and time span constraints. 1701-1710
• 
  • 
  • 
  • 
  • 
    Xiang-Kai Sun, Kok Lay Teo, Jing Zeng, Xiao-Le Guo:
    On approximate solutions and saddle point theorems for robust convex optimization. 1711-1730
• 
  • 
  • 
  • 
  • 
    Youcheng Lou:
    Some properties of the optimal investment strategy in a behavioral portfolio choice model. 1731-1746
• 
  • 
  • 
  • 
  • 
    Zsolt Darvay, Behrouz Kheirfam, Petra Renáta Rigó:
    A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization. 1747-1763
• 
  • 
  • 
  • 
  • 
    Stephan Dempe, Nazih Abderrazzak Gadhi, Khadija Hamdaoui:
    Minimizing the difference of two quasiconvex functions. 1765-1779
• 
  • 
  • 
  • 
  • 
    Zhao Deng, Sanyang Liu:
    Generalized Peaceman-Rachford splitting method with substitution for convex programming. 1781-1802
• 
  • 
  • 
  • 
  • 
    Jun Yang, Hongwei Liu:
    The subgradient extragradient method extended to pseudomonotone equilibrium problems and fixed point problems in Hilbert space. 1803-1816
• 
  • 
  • 
  • 
  • 
    Dang Van Hieu, Aviv Gibali:
    Strong convergence of inertial algorithms for solving equilibrium problems. 1817-1843
• 
  • 
  • 
  • 
  • 
    Yoshihiro Kanno:
    An accelerated Uzawa method for application to frictionless contact problem. 1845-1854
• 
  • 
  • 
  • 
  • 
    Zhibin Deng, Cheng Lu, Ye Tian, Jian Luo:
    Globally solving extended trust region subproblems with two intersecting cuts. 1855-1867
• 
  • 
  • 
  • 
  • 
    Byung-Cheon Choi, Jibok Chung, Myoung-Ju Park:
    A just-in-time scheduling problem with two competing agents. 1869-1886
• 
  • 
  • 
  • 
  • 
    Junyuan Wang, Jimin Ye:
    Extended repair model for a deteriorating system with its repairman having vacations. 1887-1905
• 
  • 
  • 
  • 
  • 
    Xiaoli Cen, Yong Xia:
    Globally maximizing the sum of squares of quadratic forms over the unit sphere. 1907-1919
• 
  • 
  • 
  • 
  • 
    Shanshan Hou, André Garrido, Neng Fan:
    Vulnerability analysis of interdependent network via integer programming approaches. 1921-1942
• 
  • 
  • 
  • 
  • 
    Cong Sun, Jin-Peng Liu:
    New stepsizes for the gradient method. 1943-1955
• 
  • 
  • 
  • 
  • 
    Shi-Liang Wu, Cui-Xia Li:
    A note on unique solvability of the absolute value equation. 1957-1960
• 
  • 
  • 
  • 
  • 
    Zhiyong Zhou, Jun Yu:
    Phaseless compressive sensing using partial support information. 1961-1973

Volume 14, Number 8, November 2020

• 
  • 
  • 
  • 
  • 
    Heinz H. Bauschke, Regina Sandra Burachik, Daniel B. Herman, C. Yalçin Kaya:
    On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections. 1975-1987
• 
  • 
  • 
  • 
  • 
    Ron Estrin, Michael P. Friedlander:
    A perturbation view of level-set methods for convex optimization. 1989-2006
• 
  • 
  • 
  • 
  • 
    Roland Hildebrand:
    On the algebraic structure of the copositive cone. 2007-2019
• 
  • 
  • 
  • 
  • 
    Pham Ngoc Anh, Tran Van Thang:
    Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization. 2021-2037
• 
  • 
  • 
  • 
  • 
    Youcef Magnouche, Sébastien Martin:
    Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm. 2039-2053
• 
  • 
  • 
  • 
  • 
    Phan Quoc Khanh, Nguyen Minh Tung:
    On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming. 2055-2072
• 
  • 
  • 
  • 
  • 
    Bin Yao, Shengjie Li:
    Second-order optimality conditions for set optimization using coradiant sets. 2073-2086
• 
  • 
  • 
  • 
  • 
    Mehmet Önal, Erinç Albey:
    Economic lot sizing problem with inventory dependent demand. 2087-2106
• 
  • 
  • 
  • 
  • 
    Wuyang Yu:
    Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors. 2107-2125
• 
  • 
  • 
  • 
  • 
    Pierre Hosteins:
    A compact mixed integer linear formulation for safe set problems. 2127-2148
• 
  • 
  • 
  • 
  • 
    Zhongyi Jiang, Qiying Hu:
    The complexity results of the sparse optimization problems and reverse convex optimization problems. 2149-2160
• 
  • 
  • 
  • 
  • 
    Yifei Ren, Zhiqiang Lu, Xinyi Liu:
    A branch-and-bound embedded genetic algorithm for resource-constrained project scheduling problem with resource transfer time of aircraft moving assembly line. 2161-2195
• 
  • 
  • 
  • 
  • 
    Fernando E. Vilas, Eli V. Olinick, David W. Matula:
    Bounds on maximum concurrent flow in random bipartite graphs. 2197-2209
• 
  • 
  • 
  • 
  • 
    Roman Kolpakov, Mikhail Posypkin:
    The scalability analysis of a parallel tree search algorithm. 2211-2226
• 
  • 
  • 
  • 
  • 
    Constantin Zalinescu:
    On quadratically constrained quadratic optimization problems and canonical duality theory. 2227-2245
• 
  • 
  • 
  • 
  • 
    Miguel A. Goberna, Marco A. López, Andrea B. Ridolfi, Virginia N. Vera de Serio:
    A note on primal-dual stability in infinite linear programming. 2247-2263
• 
  • 
  • 
  • 
  • 
    Yan Liu, Xiao Wang, Tiande Guo:
    A linearly convergent stochastic recursive gradient method for convex optimization. 2265-2283
• 
  • 
  • 
  • 
  • 
    Sana Frifita, Ines Mathlouthi, Malek Masmoudi, Abdelaziz Dammak:
    Variable neighborhood search based algorithms to solve a rich k-travelling repairmen problem. 2285-2299
• 
  • 
  • 
  • 
  • 
    Binwu Zhang, Xiucui Guan, Qiao Zhang:
    Inverse optimal value problem on minimum spanning tree under unit l∞ norm. 2301-2322
• 
  • 
  • 
  • 
  • 
    Kuan Lu, Shinji Mizuno, Jianming Shi:
    A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem. 2323-2333
• 
  • 
  • 
  • 
  • 
    Simeon Reich, Truong Minh Tuyen, Thi Ngoc Ha Mai:
    The split feasibility problem with multiple output sets in Hilbert spaces. 2335-2353
• 
  • 
  • 
  • 
  • 
    Yigui Ou, Haichan Lin:
    A hybrid method for solving systems of nonsmooth equations with box constraints. 2355-2377
• 
  • 
  • 
  • 
  • 
    Monairah Alansari, Kaleem Raza Kazmi, Rehan Ali:
    Hybrid iterative scheme for solving split equilibrium and hierarchical fixed point problems. 2379-2394
• 
  • 
  • 
  • 
  • 
    Sheng-lan Chen:
    Existence results for vector variational inequality problems on Hadamard manifolds. 2395-2411
• 
  • 
  • 
  • 
  • 
    Pham Duy Khanh, Vo Thanh Phat:
    Second-order characterizations of quasiconvexity and pseudoconvexity for differentiable functions with Lipschitzian derivatives. 2413-2427
• 
  • 
  • 
  • 
  • 
    Anand Subramanian, Eduardo Queiroga:
    Solution strategies for the vehicle routing problem with backhauls. 2429-2441
• 
  • 
  • 
  • 
  • 
    Shane T. Barratt, Guillermo Angeris, Stephen P. Boyd:
    Minimizing a sum of clipped convex functions. 2443-2459
• 
  • 
  • 
  • 
  • 
    Joshua D. Griffin, Riadh Omheni:
    A primal-dual modified log-barrier method for inequality constrained nonlinear optimization. 2461-2477
• 
  • 
  • 
  • 
  • 
    Annamaria Barbagallo, Serena Guarino Lo Bianco:
    Stochastic variational formulation for a general random time-dependent economic equilibrium problem. 2479-2493
• 
  • 
  • 
  • 
  • 
    Zheng Zhu, Chao Fang, Helmut G. Katzgraber:
    borealis - A generalized global update algorithm for Boolean optimization problems. 2495-2514
• 
  • 
  • 
  • 
  • 
    Juan F. Monge:
    Equally weighted cardinality constrained portfolio selection via factor models. 2515-2538
• 
  • 
  • 
  • 
  • 
    Ahmadreza Raeisi Dehkordi:
    On the convergence of the Cooper's algorithm. 2539-2547
• 
  • 
  • 
  • 
  • 
    Behrouz Kheirfam, Afsaneh Nasrollahi:
    A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization. 2549-2563
• 
  • 
  • 
  • 
  • 
    Fengqiao Luo, Sanjay Mehrotra:
    Distributionally robust optimization with decision dependent ambiguity sets. 2565-2594
• 
  • 
  • 
  • 
  • 
    Mônica A. C. Valadão, Lucas S. Batista:
    A comparative study on surrogate models for SAEAs. 2595-2614
• 
  • 
  • 
  • 
  • 
    Kanstantsin Pashkovich, Laurent Poirrier:
    Three-dimensional stable matching with cyclic preferences. 2615-2623

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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: