Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
From MaRDI portal
Publication:1411634
DOI10.1007/s10107-002-0343-9zbMath1030.90123OpenAlexW1976577659MaRDI QIDQ1411634
Michael Ulbrich, Stefan Ulbrich
Publication date: 29 October 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0343-9
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
A globally convergent penalty-free method for optimization with equality constraints and simple bounds, A new filter QP-free method for the nonlinear inequality constrained optimization problem, Global convergence of a new nonmonotone filter method for equality constrained optimization, Two globally convergent nonmonotone trust-region methods for unconstrained optimization, An infeasible nonmonotone SSLE algorithm for nonlinear programming, A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results, Nonlinear programming without a penalty function or a filter, A nonmonotone filter trust region method for the system of nonlinear equations, A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy, A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization, A new penalty-free-type algorithm based on trust region techniques, A penalty-free method with superlinear convergence for equality constrained optimization, A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold, A filter secant method with nonmonotone line search for equality constrained optimization, An efficient nonmonotone method for state-constrained elliptic optimal control problems, A non-monotone line search multidimensional filter-SQP method for general nonlinear programming, An improved nonmonotone filter trust region method for equality constrained optimization, A limited-memory trust-region method for nonlinear optimization with many equality constraints, Global convergence of a nonmonotone filter method for equality constrained optimization, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, Acceleration and Global Convergence of a First-Order Primal-Dual Method for Nonconvex Problems, A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization, An adaptively regularized sequential quadratic programming method for equality constrained optimization, A nonmonotone filter trust region method for nonlinear constrained optimization, A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems, Global and local convergence of a class of penalty-free-type methods for nonlinear programming, A modified SQP-filter method for nonlinear complementarity problem, Global and local convergence of a nonmonotone trust region algorithm for equality constrained optimization, A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization, Global and local convergence of a filter line search method for nonlinear programming, A new non-monotone SQP algorithm for the minimax problem, Filter-sequence of quadratic programming method with nonlinear complementarity problem function, A penalty-free method with line search for nonlinear equality constrained optimization, A nonmonotone SQP-filter method for equality constrained optimization, A line search exact penalty method with bi-object strategy for nonlinear constrained optimization, A penalty-function-free line search SQP method for nonlinear programming, On the Local Convergence of a Penalty-Function-Free SQP Method, A nonmonotone adaptive trust region method and its convergence, A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization, A central path interior point method for nonlinear programming and its local convergence
Uses Software
