Local saddle point and a class of convexification methods for nonconvex optimization problems (Q2460140): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A duality theorem for non-linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3688092 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Zero duality gap for a class of nonconvex optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Local saddle points and convexification for nonconvex optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Local convexification of the Lagrangian function in nonconvex optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3134873 / rank | |||
Normal rank | |||
Latest revision as of 12:03, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local saddle point and a class of convexification methods for nonconvex optimization problems |
scientific article |
Statements
Local saddle point and a class of convexification methods for nonconvex optimization problems (English)
0 references
14 November 2007
0 references
A class of general transformation methods is proposed to convert a nonconvex optimization problem to another equivalent problem. It is shown that under certain assumptions the existence of a local saddle point or local convexity of the Lagrangian function of the equivalent problem can be guaranteed. Numerical experiments are given to demonstrate the main results geometrically.
0 references
nonconvex optimization
0 references
local saddle point
0 references
convexification
0 references
local convexity
0 references
