Publication | Closed Access

A feasible descent SQP algorithm for general constrained optimization without strict complementarity

Mathematical ProgrammingEngineeringStrict ComplementarityNonlinear ProgrammingComplementarity ProblemsConvex OptimizationComputer EngineeringConstrained OptimizationInverse ProblemsComputer ScienceUnconstrained OptimizationApproximation TheoryQuadratic Programming