Pages that link to "Item:Q837710"
From MaRDI portal
The following pages link to An efficient feasible SQP algorithm for inequality constrained optimization (Q837710):
Displaying 11 items.
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233) (← links)
- Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems (Q779870) (← links)
- A type of efficient feasible SQP algorithms for inequality constrained optimization (Q846474) (← links)
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
- An ADMM-based SQP method for separably smooth nonconvex optimization (Q2069362) (← links)
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization (Q2088141) (← links)
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
- Application of the sequential parametric convex approximation method to the design of robust trusses (Q2397438) (← links)
- A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization (Q2448469) (← links)
- Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure (Q2691445) (← links)
- Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase (Q2805993) (← links)
