Publication:4702075
From MaRDI portal
zbMath1054.90631MaRDI QIDQ4702075
Publication date: 1 February 2000
90C30: Nonlinear programming
Related Items
An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments, A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints, A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization, A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity, New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate, A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization, An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity