Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2016

Highly Cited

2016

Thank you for downloading linear and nonlinear programming. As you may know, people have search numerous times for their favorite… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

Abstract.We present a primal-dual interior-point algorithm with a filter line-search method for nonlinear programming. Local and… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

The design and implementation of a new algorithm for solving large nonlinear programming problems is described. It follows a… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1993

Highly Cited

1993

COMPREHENSIVE COVERAGE OF NONLINEAR PROGRAMMING THEORY AND ALGORITHMS, THOROUGHLY REVISED AND EXPANDED"Nonlinear Programming… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

The dynamics of the modified canonical nonlinear programming circuit are studied and how to guarantee the stability of the… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

I* Basics 1 Optimization Models 2 Fundamentals of Optimization 3 Representation of Linear Constraints II Linear Programming 4… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

Preface 1. Introduction to nonlinear programming 2. Large, sparse nonlinear programming 3. Optimal control preliminaries 4. The… Expand

Is this relevant?

Highly Cited

1969

Highly Cited

1969

Part 1 (if): Assume that Z is closed. We must show that if A is closed for all k → x x , k → y y , where ( k A ∈ ) k y x , then… Expand

Is this relevant?