Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Shaoning Han"'
Autor:
SHAONING HAN1 shaoning@usc.edu, JONG-SHI PANG1 jongship@usc.edu
Publikováno v:
SIAM Journal on Optimization. 2024, Vol. 34 Issue 1, p870-892. 23p.
Publikováno v:
Mathematical Programming.
This paper studies several solution paths of sparse quadratic minimization problems as a function of the weighing parameter of the bi-objective of estimation loss versus solution sparsity. Three such paths are considered: the “$$\ell _0$$ ℓ 0 -pa
Publikováno v:
Journal of Global Optimization. 84:77-93
In this note we study multiple-ratio fractional 0--1 programs, a broad class of NP-hard combinatorial optimization problems. In particular, under some relatively mild assumptions we provide a complete characterization of the conditions, which ensure
Publikováno v:
Mathematical Programming.
In this paper, we study the convex quadratic optimization problem with indicator variables. For the $${2\times 2}$$ 2 × 2 case, we describe the convex hull of the epigraph in the original space of variables, and also give a conic quadratic extended
Autor:
JONG-SHI PANG1 jongship@usc.edu, SHAONING HAN1 shaoning@usc.edu
Publikováno v:
SIAM Journal on Optimization. 2023, Vol. 33 Issue 2, p899-920. 22p.
In this paper, we compare the strength of the optimal perspective reformulation and Shor's SDP relaxation. We prove these two formulations are equivalent for quadratic optimization problems with indicator variables.
Comment: arXiv admin note: su
Comment: arXiv admin note: su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26afdf9492abd09485874a9fa0d8b60f
Autor:
Atamtürk, Alper1 ATAMTURK@BERKELEY.EDU, Gómez, Andrés2 GOMEZAND@USC.EDU, Shaoning Han2 GOMEZAND@USC.EDU
Publikováno v:
Journal of Machine Learning Research. 2021, Vol. 22, p1-43. 43p.