Papers › Locally Feasibly Projected Sequential Quadratic Programming for Nonlinear Programming...

Locally Feasibly Projected Sequential Quadratic Programming for Nonlinear Programming on Arbitrary Smooth Constraint Manifolds

5 Nov 2021arXiv:2111.03236links table onlyarchive 2025-07-28

Kevin S. Silmore, James W. Swan

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

High-dimensional nonlinear optimization problems subject to nonlinear constraints can appear in several contexts including constrained physical and dynamical systems, statistical estimation, and other numerical models. Feasible optimization routines can sometimes be valuable if the objective function is only defined on the feasible set or if numerical difficulties associated with merit functions or infeasible termination arise during the use of infeasible optimization routines. Drawing on the Riemannian optimization and sequential quadratic programming literature, a practical algorithm is constructed to conduct feasible optimization on arbitrary implicitly defined constraint manifolds. Specifically, with n (potentially bound-constrained) variables and m < n nonlinear constraints, each outer optimization loop iteration involves a single O(nm²)-flop factorization, and computationally efficient retractions are constructed that involve O(nm)-flop inner loop iterations. A package, LFPSQP.jl, is created using the Julia language that takes advantage of automatic differentiation and projected conjugate gradient methods for use in inexact/truncated Newton steps.

PaperPDFCode

Code

ksil/lfpsqp.jl officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections