A hybrid penalty method with pseudo-projection post-processing is introduced for smooth optimization subject to multiple low-rank Hankel matrix constraints, supported by convergence analysis and efficient single-constraint computation via existing SLRA software.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
Defines and relates multiple stationary-point notions for rank-regularized problems via MPEC and penalty reformulations, plus a weaker condition linking local MPEC minimizers to M-stationarity.
citing papers explorer
-
A hybrid penalty method for a class of optimization problems with multiple rank constraints
A hybrid penalty method with pseudo-projection post-processing is introduced for smooth optimization subject to multiple low-rank Hankel matrix constraints, supported by convergence analysis and efficient single-constraint computation via existing SLRA software.
-
Several classes of stationary points for rank regularized minimization problems
Defines and relates multiple stationary-point notions for rank-regularized problems via MPEC and penalty reformulations, plus a weaker condition linking local MPEC minimizers to M-stationarity.