Pages that link to "Item:Q1372561"
From MaRDI portal
The following pages link to Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints (Q1372561):
Displayed 23 items.
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems (Q437832) (← links)
- The use of QP-free algorithm in the limit analysis of slope stability (Q544226) (← links)
- Sequential systems of linear equations method for general constrained optimization without strict complementarity (Q557781) (← links)
- Parallel SSLE algorithm for large scale constrained optimization (Q628886) (← links)
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints (Q816061) (← links)
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization (Q938022) (← links)
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization (Q979866) (← links)
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization (Q988435) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- The convergence of equilibrium algorithms with non-monotone line search technique. (Q1415258) (← links)
- An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
- A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
- A globally convergent QP-free algorithm for inequality constrained minimax optimization (Q2151966) (← links)
- A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints (Q2353465) (← links)
- An infeasible nonmonotone SSLE algorithm for nonlinear programming (Q2379186) (← links)
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (Q2514657) (← links)
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming (Q2572703) (← links)
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY (Q3013564) (← links)
- Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010) (← links)
- An infeasible active-set QP-free algorithm for general nonlinear programming (Q4976293) (← links)