


default search action
Mathematical Programming, Volume 211
Volume 211, Number 1, May 2025
- Tibor Csendes, Boglárka G.-Tóth, Marco Locatelli:

Special Issue: Global Optimization. 1-3 - Wenbao Ai, Wei Liang, Jianhua Yuan:

On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints. 5-48 - Dirk Banholzer, Jörg Fliege

, Ralf Werner:
A radial basis function method for noisy global optimisation. 49-92 - Pietro Belotti

:
Convex envelopes of bounded monomials on two-variable cones. 93-123 - Leon Bungert, Tim Roith

, Philipp Wacker:
Polarized consensus-based dynamics for optimization and sampling. 125-155 - Samuel Burer

:
A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints. 157-179 - Yaohua Hu, Xinlin Hu, Xiaoqi Yang

:
On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization. 181-206 - Sebastian Lämmel

, Vladimir Shikhman:
Extended convergence analysis of the Scholtes-type regularization for cardinality-constrained optimization problems. 207-243 - Veronica Piccialli

, Antonio Maria Sudoso
:
Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming. 245-279 - Buse Sen, Deniz Akkaya

, Mustafa Ç. Pinar
:
Sparsity penalized mean-variance portfolio selection: analysis and computation. 281-318 - Luze Xu

, Jon Lee
:
Gaining or losing perspective for convex multivariate functions on box domains. 319-339 - Liding Xu

, Leo Liberti:
Submodular maximization and its generalization through an intersection cut lens. 341-377

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














