Special Issue: Global Optimization.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 1, doi. 10.1007/s10107-025-02225-0
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2025 AND VI 211 AND IP 1
Results: 12
1
2
Convex envelopes of bounded monomials on two-variable cones.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 93, doi. 10.1007/s10107-025-02212-5
- By:
- Publication type:
- Article
3
Sparsity penalized mean–variance portfolio selection: analysis and computation.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 281, doi. 10.1007/s10107-024-02161-5
- By:
- Publication type:
- Article
4
A radial basis function method for noisy global optimisation.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 49, doi. 10.1007/s10107-024-02125-9
- By:
- Publication type:
- Article
5
On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 5, doi. 10.1007/s10107-024-02105-z
- By:
- Publication type:
- Article
6
Polarized consensus-based dynamics for optimization and sampling.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 125, doi. 10.1007/s10107-024-02095-y
- By:
- Publication type:
- Article
7
Gaining or losing perspective for convex multivariate functions on box domains.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 319, doi. 10.1007/s10107-024-02087-y
- By:
- Publication type:
- Article
8
Extended convergence analysis of the Scholtes-type regularization for cardinality-constrained optimization problems.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 207, doi. 10.1007/s10107-024-02082-3
- By:
- Publication type:
- Article
9
A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 157, doi. 10.1007/s10107-024-02076-1
- By:
- Publication type:
- Article
10
On convergence of iterative thresholding algorithms to approximate sparse solution for composite nonconvex optimization.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 181, doi. 10.1007/s10107-024-02068-1
- By:
- Publication type:
- Article
11
Submodular maximization and its generalization through an intersection cut lens.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 341, doi. 10.1007/s10107-024-02059-2
- By:
- Publication type:
- Article
12
Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming.
- Published in:
- Mathematical Programming, 2025, v. 211, n. 1, p. 245, doi. 10.1007/s10107-023-02021-8
- By:
- Publication type:
- Article