A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.04.050 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011305981 / rank | |||
Normal rank | |||
Revision as of 18:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization |
scientific article |
Statements
A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (English)
0 references
11 January 2007
0 references
The authors study an extension to the method of feasible directions for solving a general optimization problem where the constraints are specified by inequalities. The proposed algorithm has the advantage that it does not require an initial feasible point (which can be time consuming) to operate. The authors present the main details of the algorithm in the first two sections. The remaining of the article studies in detail the convergence properties of the suggested algorithm. A short section containing numerical results concludes this article.
0 references
nonlinear programming
0 references
method of feasible directions
0 references
superlinear convergence
0 references
global convergence
0 references
algorithm
0 references
numerical results
0 references
