Journal of Global Optimization, Volume 84 (original) (raw)

default search action

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

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Journal of Global Optimization

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 84, Number 1, September 2022

• 
  • 
  • 
  • 
  • 
    Andreas Lundell, Jan Kronqvist, Tapio Westerlund:
    The supporting hyperplane optimization toolkit for convex MINLP. 1-41
• 
  • 
  • 
  • 
  • 
    Tiago Andrade, Nikita Belyak, Andrew C. Eberhard, Silvio Hamacher, Fabricio Oliveira:
    The p-Lagrangian relaxation for separable nonconvex MIQCQP problems. 43-76
• 
  • 
  • 
  • 
  • 
    Shaoning Han, Andrés Gómez, Oleg A. Prokopyev:
    Fractional 0-1 programming and submodularity. 77-93
• 
  • 
  • 
  • 
  • 
    Lamia Zerfa, Mohamed El-Amine Chergui:
    Finding non dominated points for multiobjective integer convex programs with linear constraints. 95-117
• 
  • 
  • 
  • 
  • 
    Tongli Zhang, Yong Xia:
    Covering a simplex by spheres: complexity and algorithms. 119-135
• 
  • 
  • 
  • 
  • 
    Liang Chen, Yu-Hong Dai, Zhou Wei:
    Sufficient conditions for existence of global minimizers of functions on Hilbert spaces. 137-147
• 
  • 
  • 
  • 
  • 
    Mikhail Yu. Kokurin:
    On the global minimization of discretized residual functionals of conditionally well-posed inverse problems. 149-176
• 
  • 
  • 
  • 
  • 
    Scott B. Lindstrom:
    The projected polar proximal point algorithm converges globally. 177-203
• 
  • 
  • 
  • 
  • 
    Nguyen Xuan Duy Bao, Phan Quoc Khanh, Nguyen Minh Tung:
    Quasi-contingent derivatives and studies of higher-orders in nonsmooth optimization. 205-228
• 
  • 
  • 
  • 
  • 
    Xianpeng Mao, Yuning Yang:
    Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors. 229-253

Volume 84, Number 2, October 2022

• 
  • 
  • 
  • 
  • 
    Steffen Rebennack:
    Data-driven stochastic optimization for distributional ambiguity with integrated confidence region. 255-293
• 
  • 
  • 
  • 
  • 
    Elisa Caprari, Lorenzo Cerboni Baiardi, Elena Molho:
    Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach. 295-320
• 
  • 
  • 
  • 
  • 
    Chrysoula Dimitra Kappatou, Dominik Bongartz, Jaromil Najman, Susanne Sass, Alexander Mitsos:
    Global dynamic optimization with Hammerstein-Wiener models embedded. 321-347
• 
  • 
  • 
  • 
  • 
    Alireza Kabgani, Felipe Lara:
    Strong subdifferentials: theory and applications in nonconvex optimization. 349-368
• 
  • 
  • 
  • 
  • 
    Xihua Zhu, Jiangze Han, Bo Jiang:
    An adaptive high order method for finding third-order critical points of nonconvex optimization. 369-392
• 
  • 
  • 
  • 
  • 
    Nan Meng, Yun-Bin Zhao, Michal Kocvara, Zhong-Feng Sun:
    Partial gradient optimal thresholding algorithms for a class of sparse optimization problems. 393-413
• 
  • 
  • 
  • 
  • 
    Meng-Meng Zheng, Zheng-Hai Huang, Sheng-Long Hu:
    Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space. 415-440
• 
  • 
  • 
  • 
  • 
    Chinedu Izuchukwu, Yekini Shehu, Jen-Chih Yao:
    New inertial forward-backward type for variational inequalities with Quasi-monotonicity. 441-464
• 
  • 
  • 
  • 
  • 
    Maldon Goodridge, John Moriarty, Jure Vogrinc, Alessandro Zocca:
    Hopping between distant basins. 465-489
• 
  • 
  • 
  • 
  • 
    Alla R. Kammerdiner, Alexander Semenov, Eduardo L. Pasiliao:
    Multidimensional Assignment Problem for Multipartite Entity Resolution. 491-523
• 
  • 
  • 
  • 
  • 
    Monica Bianchi, Gábor Kassay, Rita Pini:
    Correction to: Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization. 525-526

Volume 84, Number 3, November 2022

• 
  • 
  • 
  • 
  • 
    V. S. Amaral, Roberto Andreani, Ernesto G. Birgin, Diaulas S. Marcondes, José Mario Martínez:
    On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization. 527-561
• 
  • 
  • 
  • 
  • 
    Vassilis Apidopoulos, Nicolò Ginatta, Silvia Villa:
    Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition. 563-589
• 
  • 
  • 
  • 
  • 
    Sven de Vries, Bernd Perscheid:
    Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints. 591-606
• 
  • 
  • 
  • 
  • 
    Maximilian Merkert, Galina Orlinskaya, Dieter Weninger:
    An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities. 607-650
• 
  • 
  • 
  • 
  • 
    Holger Heitsch, René Henrion, Thomas Kleinert, Martin Schmidt:
    On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints. 651-685
• 
  • 
  • 
  • 
  • 
    Jianping Li, Wencheng Wang, Junran Lichen, Suding Liu, Pengxiang Pan:
    Approximation algorithms for solving the line-capacitated minimum Steiner tree problem. 687-714
• 
  • 
  • 
  • 
  • 
    Junhua Jia, Xiucui Guan, Qiao Zhang, Xinqiang Qian, Panos M. Pardalos:
    Inverse max+sum spanning tree problem under weighted l∞ norm by modifying max-weight vector. 715-738
• 
  • 
  • 
  • 
  • 
    Mircea Balaj:
    Scalar and vector equilibrium problems with pairs of bifunctions. 739-753
• 
  • 
  • 
  • 
  • 
    Takehiro Sano, Tsuyoshi Migita, Norikazu Takahashi:
    A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill's global convergence. 755-781
• 
  • 
  • 
  • 
  • 
    Jinxia Cen, Tahar Haddad, Van Thien Nguyen, Shengda Zeng:
    Simultaneous distributed-boundary optimal control problems driven by nonlinear complementarity systems. 783-805

Volume 84, Number 4, December 2022

• 
  • 
  • 
  • 
  • 
    David E. Bernal, Zedong Peng, Jan Kronqvist, Ignacio E. Grossmann:
    Alternative regularizations for Outer-Approximation algorithms for convex MINLP. 807-842
• 
  • 
  • 
  • 
  • 
    Xin Cheng, Xiang Li:
    Discretization and global optimization for mixed integer bilinear programming. 843-867
• 
  • 
  • 
  • 
  • 
    Benjamin Beach, Robert Hildebrand, Joey Huchette:
    Compact mixed-integer programming formulations in quadratic optimization. 869-912
• 
  • 
  • 
  • 
  • 
    Maryam Yashtini:
    Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization. 913-939
• 
  • 
  • 
  • 
  • 
    Jing Zhao, Qiao-Li Dong, Michael Th. Rassias, Fenghui Wang:
    Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems. 941-966
• 
  • 
  • 
  • 
  • 
    Yair Censor, Daniel Reem, Maroun Zaknoon:
    A generalized block-iterative projection method for the common fixed point problem induced by cutters. 967-987
• 
  • 
  • 
  • 
  • 
    Qingsong Tang, Xiangde Zhang, Cheng Zhao, Peng Zhao:
    On the maxima of motzkin-straus programs and cliques of graphs. 989-1003
• 
  • 
  • 
  • 
  • 
    William La Cruz:
    A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations. 1005-1032
• 
  • 
  • 
  • 
  • 
    Christian Bingane:
    Tight bounds on the maximal perimeter and the maximal width of convex small polygons. 1033-1051
• 
  • 
  • 
  • 
  • 
    Wei Liu, Li Yang, Bo Yu:
    Kernel density estimation based distributionally robust mean-CVaR portfolio optimization. 1053-1077

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: