Global convergence of a nonlinear programming method using convex approximations (Q5948218): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CONLIN / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:46, 4 March 2024
scientific article; zbMATH DE number 1667974
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global convergence of a nonlinear programming method using convex approximations |
scientific article; zbMATH DE number 1667974 |
Statements
Global convergence of a nonlinear programming method using convex approximations (English)
0 references
31 October 2001
0 references
The method of moving asymptotes (MMA) and its globally convergent extension SCP (sequential convex programming) are known to work well for certain problems arising in structural optimization. In this paper, the methods are extended for a general mathematical programming framework and a new scheme to update certain penalty parameters is defined, which leads to a considerable improvement in the performance. Properties of the approximation functions are outlined in detail. All convergence results of the traditional methods are preserved.
0 references
convex approximations
0 references
sequential convex programming
0 references
method of moving asymptotes
0 references
global convergence
0 references
