Login / Signup

A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity.

Jin-Bao JianXiao-yan KeWei-xin Cheng
Published in: Appl. Math. Comput. (2009)
Keyphrases
  • constrained optimization
  • objective function
  • probabilistic model
  • optimization algorithm
  • k means
  • search methods
  • penalty function
  • unconstrained optimization
  • lagrange multiplier method