REVIEW 1 cited by
Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper we study a broad class of structured nonlinear programming (SNLP) problems. In particular, we first establish the first-order optimality conditions for them. Then we propose sequential convex programming (SCP) methods for solving them in which each iteration is obtained by solving a convex programming problem. Under some suitable assumptions, we establish that any accumulation point of the sequence generated by the methods is a KKT point of the SNLP problems. In addition, we propose a variant of the SCP method for SNLP in which nonmonotone scheme and ``local'' Lipschitz constants of the associated functions are used. A similar convergence result as mentioned above is established.
Forward citations
Cited by 1 Pith paper
-
A first-order method for constrained nonconvex-nonconcave minimax optimization
Under a local Kurdyka-Łojasiewicz condition, the constrained nonconvex-nonconcave minimax value function is locally generalized Hölder smooth, and an interleaved SCP/proximal-gradient method achieves Õ(ε^{−max{1/(1−θ)...
Discussion (0). Continue with ORCID to comment.