A reduced Hessian algorithm with line search filter method for nonlinear programming (Q544068): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: De-Tong Zhu / rank | |||
Property / author | |||
Property / author: De-Tong Zhu / rank | |||
Normal rank | |||
Property / review text | |||
The authors consider the problem of minimizing a nonlinear function subject to a set of nonlinear equality constraints, where the objective function and the equality constraints are sufficiently smooth. Filter algorithms (introduced by \textit{R. Fletcher, S. Leyffer} and \textit{P. L. Toint} [SIAM J. Optim. 13, No.~1, 44--59 (2002; Zbl 1029.65063)]) use a function that aggregates constraint violations and then treats the resulting biobjective problem. A step is accepted if it reduces the value either of the objective function or of the constraint violation. This paper proposes a line search filter reduced Hessian method for nonlinear equality constrained optimization. The feature of the presented algorithm is that the reduced Hessian method is used to produce a search direction, a backtracking line search procedure to generate step size, some filtered rules to determine step acceptance, and second order correction technique to reduce infeasibility and overcome the Maratos effects. It is shown that this algorithm does not suffer from the Maratos effects by using second order correction step, and under mild assumptions fast convergence to second order sufficient local solutions is achieved. A numerical experiment is reported to show the effectiveness of the proposed algorithm. | |||
Property / review text: The authors consider the problem of minimizing a nonlinear function subject to a set of nonlinear equality constraints, where the objective function and the equality constraints are sufficiently smooth. Filter algorithms (introduced by \textit{R. Fletcher, S. Leyffer} and \textit{P. L. Toint} [SIAM J. Optim. 13, No.~1, 44--59 (2002; Zbl 1029.65063)]) use a function that aggregates constraint violations and then treats the resulting biobjective problem. A step is accepted if it reduces the value either of the objective function or of the constraint violation. This paper proposes a line search filter reduced Hessian method for nonlinear equality constrained optimization. The feature of the presented algorithm is that the reduced Hessian method is used to produce a search direction, a backtracking line search procedure to generate step size, some filtered rules to determine step acceptance, and second order correction technique to reduce infeasibility and overcome the Maratos effects. It is shown that this algorithm does not suffer from the Maratos effects by using second order correction step, and under mild assumptions fast convergence to second order sufficient local solutions is achieved. A numerical experiment is reported to show the effectiveness of the proposed algorithm. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C30 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5907616 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
nonlinear programming | |||
Property / zbMATH Keywords: nonlinear programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
filter method | |||
Property / zbMATH Keywords: filter method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
reduced Hessian algorithm | |||
Property / zbMATH Keywords: reduced Hessian algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
line search | |||
Property / zbMATH Keywords: line search / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Maratos effect | |||
Property / zbMATH Keywords: Maratos effect / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
second order correction | |||
Property / zbMATH Keywords: second order correction / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convergence | |||
Property / zbMATH Keywords: convergence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
numerical experiment | |||
Property / zbMATH Keywords: numerical experiment / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Nada I. Djuranović-Miličić / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.amc.2011.02.071 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2093185768 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Reduced Hessian Method for Large-Scale Constrained Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3702408 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Test example for nonlinear programming codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On filter-successive linearization methods for nonlinear semidefinite programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: More test examples for nonlinear programming codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization theory and methods. Nonlinear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Line Search Filter Methods for Nonlinear Programming: Local Convergence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:28, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A reduced Hessian algorithm with line search filter method for nonlinear programming |
scientific article |
Statements
A reduced Hessian algorithm with line search filter method for nonlinear programming (English)
0 references
14 June 2011
0 references
The authors consider the problem of minimizing a nonlinear function subject to a set of nonlinear equality constraints, where the objective function and the equality constraints are sufficiently smooth. Filter algorithms (introduced by \textit{R. Fletcher, S. Leyffer} and \textit{P. L. Toint} [SIAM J. Optim. 13, No.~1, 44--59 (2002; Zbl 1029.65063)]) use a function that aggregates constraint violations and then treats the resulting biobjective problem. A step is accepted if it reduces the value either of the objective function or of the constraint violation. This paper proposes a line search filter reduced Hessian method for nonlinear equality constrained optimization. The feature of the presented algorithm is that the reduced Hessian method is used to produce a search direction, a backtracking line search procedure to generate step size, some filtered rules to determine step acceptance, and second order correction technique to reduce infeasibility and overcome the Maratos effects. It is shown that this algorithm does not suffer from the Maratos effects by using second order correction step, and under mild assumptions fast convergence to second order sufficient local solutions is achieved. A numerical experiment is reported to show the effectiveness of the proposed algorithm.
0 references
nonlinear programming
0 references
filter method
0 references
reduced Hessian algorithm
0 references
line search
0 references
Maratos effect
0 references
second order correction
0 references
convergence
0 references
numerical experiment
0 references
0 references
0 references