Pages that link to "Item:Q3506289"
From MaRDI portal
The following pages link to A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization (Q3506289):
Displaying 13 items.
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
- Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems (Q779870) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- Stochastic approach for the solution of multi-pantograph differential equation arising in cell-growth model (Q1643314) (← 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)
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems (Q2257747) (← links)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
- A superlinearly convergent hybrid algorithm for solving nonlinear programming (Q2628199) (← links)
- Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure (Q2691445) (← links)
- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization (Q6102892) (← links)
