4 papers · 1 filter
Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
Lijun Xie, Ran Gu, Xin Liu
This paper addresses a quadratic problem with assignment constraints, an NP-hard combinatorial optimization problem arisen from facility location, multiple-input multiple-output de…
A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
Jinling Zhou, Xin Liu, Jiawang Nie +1
This paper studies how to compute global minimizers of the cubic-quartic regularization (CQR) problem \[ \min_{s \in \mathbb{R}^n} \quad f_0+g^Ts+\frac{1}{2}s^THs+\fracβ{6}\| s \|^…
Partial Envelope for Optimization Problem with Nonconvex Constraints
Xiaoyin Hu, Xin Liu, Kim-Chuan Toh +1
In this paper, we consider the nonlinear constrained optimization problem (NCP) with constraint set , where is a closed convex subset…
A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
Nachuan Xiao, Xiaoyin Hu, Xin Liu +1
In this paper, we focus on the nonconvex-nonconvex bilevel optimization problem (BLO), where both upper-level and lower-level objectives are nonconvex, with the upper-level problem…