Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method (Q988146): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3886397 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nondifferential optimization via adaptive smoothing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Aggregate Constraint Method for Non-Linear Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The aggregate constraint homotopy method for nonconvex nonlinear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998344 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3878408 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One / rank | |||
Normal rank |
Latest revision as of 03:35, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method |
scientific article |
Statements
Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method (English)
0 references
26 August 2010
0 references
By introducing \(C^2\) mappings \(\xi_i(x,z_i),\;i=1,2,\dots, m\) and using the idea of the aggregate function method, which replaces the exact aggregation \(\max_{i=1,2,\dots,m} g_i(x)\) by a smooth asymptotically exact aggregation \(g(x,\rho)=\rho\ln\sum_{j=1}^m \exp(g_i(x)/\rho), \rho\downarrow +0\), a new aggregate constraint homotopy method is proposed to solve the Karush-Kuhn-Tucker (KKT) conditions on nonlinear programming problems. With this mapping \(\xi\) the usual normal cone condition is weakened and the region for determining a starting point is greatly enlarged which may improve the computational efficiency of reduced predictor-corrector algorithms. The main results are proven and demonstrated with to examples. It remains open how to find the mappings \(\xi_i\) satisfying the weak normal cone conditions \(C_1,\dots, C_4\). Once the \(\xi_i\) are known then \(\xi=\sum_{i=1}^m \xi_i(x,y_i(x,\rho))z\) where \(\nabla_x g(x,\rho)=\sum_{i=1}^m y_i(x,\rho)\nabla g_i(x)\). Using \(\nabla_x g_i(x,\theta \mu)\) and \(\xi\) they construct a homotopy for KKT-conditions where for \(\mu=1\) the initial points are the solution und for \(\mu\rightarrow +0\) the solution of the original problems is given. The Euler-Newton procedure is used.
0 references
aggregate constraint homotopy method
0 references
numerical examples
0 references
Karush-Kuhn-Tucker conditions
0 references
nonlinear programming
0 references
computational efficiency
0 references
predictor-corrector algorithms
0 references
Euler-Newton procedure
0 references
0 references