default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 92
Volume 92, Number 1, May 2025
- Anatoliy Kuznetsov
, Nikolaos V. Sahinidis:
Simultaneous convexification for the planar obnoxious facility location problem. 1-20 - Jason Ye, Joseph K. Scott:
Tightening state relaxations for global dynamic optimization using dynamic cuts. 21-54 - Napsu Karmitsa, Kaisa Joki, Antti Airola, Tapio Pahikkala:
Limited memory bundle DC algorithm for sparse pairwise kernel learning. 55-85 - Najmeh Hoseini Monjezi:
Bundle trust region algorithm based on linear subproblem. 87-109 - Nguyen Canh Hung, Thai Doan Chuong, Nguyen Le Hoang Anh:
Solution existence for a class of nonsmooth robust optimization problems. 111-133 - Ewa M. Bednarczuk, Monika Syga:
Characterisation of zero duality gap for optimization problems in spaces without linear structure. 135-158 - Marianna De Santis, Gabriele Eichfelder, Daniele Patria, Leo Warnow:
Using dual relaxations in multiobjective mixed-integer convex quadratic programming. 159-186 - Glaydston de Carvalho Bento, João Xavier da Cruz Neto, Jurandir O. Lopes, Boris S. Mordukhovich, Pedro R. Silva Filho:
A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces. 187-203 - Ítalo Santana, Breno Serrano, Maximilian Schiffer, Thibaut Vidal:
Support vector machines with the hard-margin loss: optimal training via combinatorial Benders' cuts. 205-225 - Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara:
Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles. 227-251
Volume 92, Number 2, June 2025
- Antonio Candelieri, Andrea Ponti, Francesco Archetti:
Gaussian Process regression over discrete probability measures: on the non-stationarity relation between Euclidean and Wasserstein Squared Exponential Kernels. 253-278 - Satoshi Suzuki:
Quasiconjugate duality and optimality conditions for quasiconvex optimization. 279-293 - Ignacio Araya, Víctor Reyes, Javier Montero:
Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization. 295-320 - Godai Azuma, Sunyoung Kim, Makoto Yamashita:
Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations. 321-343 - Gao-Xi Li, Xin-Min Yang, Xian-Jun Long:
Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints. 345-379 - Jie Zhang, Xinmin Yang:
Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation. 381-410 - Vu Thi Huong, Hong-Kun Xu, Nguyen Dong Yen:
Stability analysis of split equality and split feasibility problems. 411-429 - Xue-liu Li, Yi-rong Jiang, Yuning Yang, Guo-ji Tang:
Extended vertical tensor complementarity problems with finite solution sets. 431-452 - Cheng Lu:
Revisiting non-monotone regularized submodular maximization: bi-criteria and PASS approximations. 453-481 - Alexander Westcott, Charl J. Ras:
An exact algorithm for disaster-resilience augmentation of planar straight-line graphs. 483-508
Volume 92, Number 3, July 2025
- Jiawang Nie, Suhan Zhong:
Distributionally Robust Optimization with Polynomial Robust Constraints. 509-534 - Queenie Yingkun Huang, Vaithilingam Jeyakumar, Guoyin Li, Duong Thi Kim Huyen:
Convexifiable quadratic inequality systems: new minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems. 535-568 - Tommaso Giovannelli, Griffin D. Kent, Luís Nunes Vicente:
Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems. 569-614 - Susanne Sass, Alexander Mitsos, Nikolay I. Nikolov, Angelos Tsoukalas:
Out-of-sample estimation for a branch-and-bound algorithm with growing datasets. 615-642 - Valentin V. Gorokhovik:
Infinite-dimensional convex cones: internal geometric structure and analytical representation. 643-662 - Lidija Fodor, Dusan Jakovetic, Natasa Krejic, Greta Malaspina:
Parallel inexact Levenberg-Marquardt method for nearly-separable nonlinear least squares. 663-691 - Tanxing Wang, Yaning Jiang, Xingju Cai:
Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems. 693-711 - Woocheol Choi, Doheon Kim, Seok-Bae Yun:
On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize. 713-736 - Jinji Yang, Jiang Hu, Chungen Shen:
A dual adaptive algorithm for matrix optimization with sparse group lasso regularization. 737-774 - Kai Chen, Ling Liang, Shaohua Pan:
Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate. 775-807 - Lifeng Zhang, Congqin Ge, Yanfeng Zhang, Wenhui Yang, Bingzhen Chen, Zhihong Yuan:
A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem. 809-835
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-12-12 01:08 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:
