A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization

Cites Work

On an inexact trust-region SQP-filter method for constrained nonlinear optimization
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
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
A nonmonotone filter method for nonlinear optimization
Updating the regularization parameter in the adaptive cubic regularization algorithm
On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization
Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
Cubic regularization in symmetric rank-1 quasi-Newton methods
A globally convergent primal-dual interior-point filter method for nonlinear programming
Adaptive regularization with cubics on manifolds
New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
A penalty-free method with superlinear convergence for equality constrained optimization
Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization
CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
Cubic regularization of Newton method and its global performance
A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results
A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
Trust Region Methods
Theory and application of p-regularized subproblems for p>2
An affine covariant composite step method for optimization with PDEs as equality constraints
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
ARC_q: a new adaptive regularization by cubics
On Regularization and Active-set Methods with Complexity for Constrained Optimization
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization
An improvement of adaptive cubic regularization method for unconstrained optimization problems
A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method
Benchmarking optimization software with performance profiles.
Nonlinear programming without a penalty function.

This page was built for publication: A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization