Complexity analysis of a trust funnel algorithm for equality constrained optimization
From MaRDI portal
nonconvex optimizationnonlinear optimizationworst-case iteration complexityequality constrained optimizationtrust funnel methods
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Abstract computational complexity for mathematical programming problems (90C60) Newton-type methods (49M15)
Abstract: A method is proposed for solving equality constrained nonlinear optimization problems involving twice continuously differentiable functions. The method employs a trust funnel approach consisting of two phases: a first phase to locate an -feasible point and a second phase to seek optimality while maintaining at least -feasibility. A two-phase approach of this kind based on a cubic regularization methodology was recently proposed along with a supporting worst-case iteration complexity analysis. Unfortunately, however, in that approach, the objective function is completely ignored in the first phase when -feasibility is sought. The main contribution of the method proposed in this paper is that the same worst-case iteration complexity is achieved, but with a first phase that also accounts for improvements in the objective function. As such, the method typically requires fewer iterations in the second phase, as the results of numerical experiments demonstrate.
Recommendations
- Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization
- scientific article; zbMATH DE number 740463
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- Dynamic Control of Infeasibility in Equality Constrained Optimization
Cites work
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians
- A constrained formulation of maximum-likelihood estimation for normal mixture distributions
- A second derivative SQP method: global convergence
- A second derivative SQP method: local convergence and practical issues
- A second-derivative SQP method with a `trust-region-free' predictor step
- A sequential quadratic programming algorithm with an additional equality constrained phase
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Affine conjugate adaptive Newton methods for nonlinear elastomechanics
- An Inexact SQP Method for Equality Constrained Optimization
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- An inexact sequential quadratic optimization algorithm for nonlinear optimization
- An interior-point trust-funnel algorithm for nonlinear optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Computing a Trust Region Step
- Cubic regularization of Newton method and its global performance
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- Nonlinear programming without a penalty function or a filter
- On High-order Model Regularization for Constrained Optimization
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
- Optimal solvers for PDE-constrained optimization
- Parallel Lagrange--Newton--Krylov--Schur Methods for PDE-Constrained Optimization. Part I: The Krylov--Schur Solver
- Real-Time PDE-Constrained Optimization
- Trust Region Methods
Cited in
(8)- Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization
- TRUST: A Deterministic Algorithm for Global Optimization
- Complexity of a projected Newton-CG method for optimization with bounds
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
- On regularization and active-set methods with complexity for constrained optimization
- Hessian barrier algorithms for non-convex conic optimization
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
This page was built for publication: Complexity analysis of a trust funnel algorithm for equality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4641670)
