Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems
From MaRDI portal
Publication:6333154
DOI10.1137/20M1314057zbMath1527.90184arXiv2001.06998MaRDI QIDQ6333154
Ting Kei Pong, Peiran Yu, Zhaosong Lu
Publication date: 20 January 2020
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
This page was built for publication: Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems
