default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 75
Volume 75, Number 1, September 2019
- Kaisa Miettinen, Francisco Ruiz
:
Preface on the Special Issue Global Optimization with Multiple Criteria: Theory, Methods and Applications. 1-2 - Kaifeng Yang, Michael Emmerich, André H. Deutz, Thomas Bäck:
Efficient computation of expected hypervolume improvement using box decomposition algorithms. 3-34 - Ozgu Turgut, Evrim Dalkiran, Alper Ekrem Murat:
An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems. 35-62 - Kanako Mita, Ellen H. Fukuda, Nobuo Yamashita:
Nonmonotone line searches for unconstrained multiobjective optimization problems. 63-90 - Ignacio Araya, Jose Campusano, Damir Aliquintui:
Nonlinear biobjective optimization: improvements to interval branch & bound algorithms. 91-110 - Elena Constantin:
Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems. 111-129 - Mehdi Chinaie, Fatemeh Fakhar, Majid Fakhar, Hamid Reza Hajisharifi:
Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem. 131-141 - Bice Cavallo:
Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem. 143-161 - Marco Castellani, Massimiliano Giuli:
A coercivity condition for nonmonotone quasiequilibria on finite-dimensional spaces. 163-176 - John Edwin Cotrina, Javier Zúñiga:
Quasi-equilibrium problems with non-self constraint map. 177-197 - Alok Shukla, Prakash Vedula:
Trajectory optimization using quantum computing. 199-225
Volume 75, Number 2, October 2019
- Paula Alexandra Amaral, Immanuel M. Bomze:
Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations. 227-245 - Can Li, Ignacio E. Grossmann:
A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables. 247-272 - Erfan Mehmanchi, Andrés Gómez, Oleg A. Prokopyev:
Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations. 273-339 - Hatim Djelassi, Moll Glass, Alexander Mitsos:
Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints. 341-392 - Yankai Cao, Victor M. Zavala:
A scalable global optimization algorithm for stochastic nonlinear programs. 393-416 - Anwa Zhou, Jinyan Fan:
A hierarchy of semidefinite relaxations for completely positive tensor optimization problems. 417-437 - Anna Nagurney, Deniz Besik, Ladimer S. Nagurney:
Global supply chain networks and tariff rate quotas: equilibrium analysis with application to agricultural products. 439-460 - Rujun Jiang, Duan Li:
Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming. 461-494 - Aleksandr V. Pankratov, Tatiana E. Romanova, Igor S. Litvinchev:
Packing ellipses in an optimized convex polygon. 495-522 - Welington de Oliveira:
Proximal bundle methods for nonsmooth DC programming. 523-563
Volume 75, Number 3, November 2019
- Jaromil Najman, Alexander Mitsos:
Tighter McCormick relaxations through subgradient propagation. 565-593 - Emmanuel Ogbe, Xiang Li:
A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs. 595-629 - Masaki Kimizuka, Sunyoung Kim, Makoto Yamashita:
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods. 631-654 - Moslem Zamani:
A new algorithm for concave quadratic programming. 655-681 - Shuijing Xiao, Guangxing Zeng:
Solving the equality-constrained minimization problem of polynomial functions. 683-733 - Michel Minoux, Riadh Zorgati:
Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems. 735-766 - Bo Wen, Xiaoping Xue:
On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems. 767-787 - Nguyen Ngoc Luan, Jen-Chih Yao:
Generalized polyhedral convex optimization problems. 789-811 - Guowei Dai, Fengwei Li, Yuefang Sun, Dachuan Xu, Xiaoyan Zhang:
Convergence and correctness of belief propagation for the Chinese postman problem. 813-831 - Suning Gong, Qingqin Nong, Wenjing Liu, Qizhi Fang:
Parametric monotone function maximization with matroid constraints. 833-849 - Lorella Fatone, Francesca Mariani:
Systemic risk governance in a dynamical model of a banking system. 851-883
Volume 75, Number 4, December 2019
- Thai Doan Chuong, V. Jeyakumar, Guoyin Li:
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs. 885-919 - Can Li, Ignacio E. Grossmann:
A finite ϵ -convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables. 921-947 - Ali Baharev, Arnold Neumaier, Hermann Schichl:
A manifold-based approach to sparse global constraint satisfaction problems. 949-971 - Stefan Sremac, Fei Wang, Henry Wolkowicz, Lucas Pettersson:
Noisy Euclidean distance matrix completion with a single missing node. 973-1002 - Yaohua Hu, Carisa Kwok Wai Yu, Xiaoqi Yang:
Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions. 1003-1028 - R. Díaz Millán, Majela Pentón Machado:
Inexact proximal ϵ -subgradient methods for composite convex optimization problems. 1029-1060 - Carlo Alberto De Bernardi, Enrico Miglierina, Elena Molho:
Stability of a convex feasibility problem. 1061-1077 - Mickael Rivier, Pietro Marco Congedo:
Surrogate-assisted Bounding-Box approach for optimization problems with tunable objectives fidelity. 1079-1109 - Zhao Zhang, Zaixin Lu, Xianyue Li, Xiaohui Huang, Ding-Zhu Du:
Online hole healing for sensor coverage. 1111-1131 - Yishuo Shi, Yingli Ran, Zhao Zhang, James Willson, Guangmo Tong, Ding-Zhu Du:
Approximation algorithm for the partial set multi-cover problem. 1133-1146
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 2025-02-07 23:37 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:
