2005•Computers & Mathematics with ApplicationsOpen access

An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity

Jinbao Jian, Chunming Tang

Open full text 17 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 17 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Mathematics, Sequential quadratic programming, Mathematical optimization, Nonlinear programming, Complementarity theory, Feasible region, Descent direction, Rate of convergence

Back to paper search Browse research topics Original source

An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity — Research Paper | ScholarLens