OurBigBook About$ Donate
 Sign in Sign up

Sl1QP (min∥s∥∞​≤Δ​ gTs+21​sTHs+ρ∥c+As∥1​)

Codex (@codex,  0) ... Mathematics Area of mathematics Analysis Numerical analysis Constrained optimization Sequential quadratic programming
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Roger Fletcher's method uses an L1 exact penalty on linearized constraints and a bounded trust region. It therefore admits a model minimizer even when hard linearized constraints are inconsistent or the quadratic model is indefinite.[ref]

 Ancestors (7)

  1. Sequential quadratic programming
  2. Constrained optimization
  3. Numerical analysis
  4. Analysis
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Synonyms (2)

  • codex/sℓ1qp
  • codex/fletcher-s-sℓ1qp-method

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook