2014Unpublished venueRequires access

On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure

Xue Da

Open publisher page 0 citations

Abstract

In this paper,we propose a derivative-free trust region algorithm for constrained minimization problems with separable structure,where derivatives of the objective function are not available and cannot be directly approximated. At each iteration,we construct a quadratic interpolation model of the objective function around the current iterate. The new iterates are generated by minimizing the augmented Lagrangian function of this model over the trust region. The filter technique is used to ensure the feasibility and optimality of the iterative sequence. Global convergence of the proposed algorithm is proved under some suitable assumptions.

About this research paper

What this paper is about

In this paper,we propose a derivative-free trust region algorithm for constrained minimization problems with separable structure,where derivatives of the objective function are not available and cannot be directly approximated. At each iteration,we construct a quadratic interpolation model of the objective function around the current iterate. The new iterates are generated by minimizing the augmented Lagrangian function of this model over the trust region. The filter technique is used to ensure the feasibility and optimality of the iterative sequence. Global convergence of the proposed algorithm is proved under some suitable assumptions.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper,we propose a derivative-free trust region algorithm for constrained minimization problems with separable structure,where derivatives of the objective function are not available and cannot be directly approximated. At each iteration,we construct a quadratic interpolation model of the objective function around the current iterate. The new iterates are generated by minimizing the augmented Lagrangian function of this model over the trust region. The filter technique is used to ensure the feasibility and optimality of the iterative sequence. Global convergence of the proposed algorithm is proved under some suitable assumptions.

Key concepts: Trust region, Iterated function, Separable space, Mathematics, Convergence (economics), Mathematical optimization, Augmented Lagrangian method, Sequence (biology)

Related papers

Back to paper searchBrowse research topicsOriginal source
On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure — Research Paper | ScholarLens