scispace - formally typeset
Search or ask a question
Topic

Nonlinear programming

About: Nonlinear programming is a research topic. Over the lifetime, 19486 publications have been published within this topic receiving 656602 citations. The topic is also known as: non-linear programming & NLP.


Papers
More filters
Journal ArticleDOI
TL;DR: Truncated-Newton methods are a family of methods for solving large optimization problems that have been a collection of powerful, flexible, and adaptable tools for large-scale nonlinear optimization.

277 citations

Journal ArticleDOI
TL;DR: In this paper, the authors describe strategies for solving large nonlinear water resources models management, which combine GAs with linear programming, by identifying a set of complicating variables in the model which, when fixed, render the problem linear in the remaining variables.

276 citations

Journal ArticleDOI
TL;DR: In this article, a method to generate exciting identification trajectories in order to minimize the effect of noise and error modeling on the standard least-squares (LS) solution is presented.
Abstract: A common way to identify the inertial parameters of robots is to use a linear model in relation to the parameters and standard least-squares (LS) techniques. This article presents a method to generate exciting identification trajectories in order to minimize the effect of noise and error modeling on the LS solution. Using nonlinear optimization techniques, the condition number of a matrix W obtained from the energy model is minimized, and the scaling of its terms is carried out. An example of a three-degree-of-freedom robot is presented.

273 citations

Book ChapterDOI
01 Oct 1997
TL;DR: In this article, the authors present a template for scatter search and path relinking methods that provides a convenient and "user friendly" basis for their implementation, which can be summarized by a small number of key steps, leading to versions of scatter search that are fully specified upon providing a handful of subroutines.
Abstract: Scatter search and its generalized form called path relinking are evolutionary methods that have recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, these methods use strategies for combining solution vectors that have proved effective for scheduling, routing, financial product design, neural network training, optimizing simulation and a variety of other problem areas. These approaches can be implemented in multiple ways, and offer numerous alternatives for exploiting their basic ideas. We identify a template for scatter search and path relinking methods that provides a convenient and “user friendly” basis for their implementation. The overall design can be summarized by a small number of key steps, leading to versions of scatter search and path relinking that are fully specified upon providing a handful of subroutines. Illustrative forms of these subroutines are described that make it possible to create methods for a wide range of optimization problems.

273 citations

Journal Article
TL;DR: It is proved that, under reasonable conditions and for every possible choice of the starting point, the sequence of iterates has at least one first-order critical accumulation point.
Abstract: A trust-region SQP-filter algorithm of the type introduced by Fletcher and Leyffer [Math. Program., 91 (2002), pp. 239--269] that decomposes the step into its normal and tangential components allows for an approximate solution of the quadratic subproblem and incorporates the safeguarding tests described in Fletcher, Leyffer, and Toint [On the Global Convergence of an SLP-Filter Algorithm, Technical Report 98/13, Department of Mathematics, University of Namur, Namur, Belgium, 1998; On the Global Convergence of a Filter-SQP Algorithm, Technical Report 00/15, Department of Mathematics, University of Namur, Namur, Belgium, 2000] is considered. It is proved that, under reasonable conditions and for every possible choice of the starting point, the sequence of iterates has at least one first-order critical accumulation point.

273 citations


Network Information
Related Topics (5)
Optimization problem
96.4K papers, 2.1M citations
93% related
Scheduling (computing)
78.6K papers, 1.3M citations
86% related
Robustness (computer science)
94.7K papers, 1.6M citations
86% related
Linear system
59.5K papers, 1.4M citations
85% related
Control theory
299.6K papers, 3.1M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023113
2022259
2021615
2020650
2019640
2018630