Pages that link to "Item:Q833162"
From MaRDI portal
The following pages link to A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity (Q833162):
Displaying 12 items.
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (Q505808) (← links)
- On the accurate identification of active set for constrained minimax problems (Q531696) (← links)
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233) (← links)
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
- Convergence analysis of norm-relaxed method of feasible directions (Q1359453) (← links)
- Optimal maximally decimated m-channel mirrored paraunitary linear phase FIR filter bank design via norm relaxed sequential quadratic programming (Q1983745) (← links)
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276) (← links)
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
- A norm-relaxed algorithm with an identification function for general constrained optimization (Q2886025) (← links)
