The watchdog technique for forcing convergence in algorithms for constrained optimization
From MaRDI portal
Publication:3934163
DOI10.1007/BFb0120945zbMath0477.90072OpenAlexW8821478MaRDI QIDQ3934163
H. C. Pedersen, R. M. Chamberlain, M. J. D. Powell, Claude Lemaréchal
Publication date: 1982
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120945
constrained optimizationconvergence accelerationline searcheswatchdog techniqueQ-superlinear rate of convergence
Related Items
An overview of nonlinear optimization, An improvement of adaptive cubic regularization method for unconstrained optimization problems, A pathsearch damped Newton method for computing general equilibria, A class of nonmonotone stabilization trust region methods, Nonmonotone trust region method for solving optimization problems, Experiments with successive quadratic programming algorithms, Unnamed Item, A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter, A sparse sequential quadratic programming algorithm, A truncated Newton method with non-monotone line search for unconstrained optimization, Two globally convergent nonmonotone trust-region methods for unconstrained optimization, Nonmonotone derivative-free methods for nonlinear equations, An analysis of reduced Hessian methods for constrained optimization, Implementation issues in solving nonlinear equations for two-point boundary value problems, A successive quadratic programming algorithm with global and superlinear convergence properties, Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters, A simple feasible SQP algorithm for inequality constrained optimization, A recursive quadratic programming algorithm that uses differentiable exact penalty functions, A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints, An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point, Recent developments in constrained optimization, A new nonmonotone trust region method for unconstrained optimization equipped by an efficient adaptive radius, A globally convergent version of a general recursive algorithm for nonlinear programming, Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints, A successive quadratic programming method that uses new corrections for search directions, Unnamed Item, A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints, An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming, A nonmonotone trust region method with adaptive radius for unconstrained optimization problems, A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results, Matrix criterion robust linear quadratic control problem, A penalty-free method with superlinear convergence for equality constrained optimization, An efficient nonmonotone trust-region method for unconstrained optimization, Enlarging the region of convergence of Newton's method for constrained optimization, A nonmonotone trust-region line search method for large-scale unconstrained optimization, Canonical coordinates method for equality-constrained nonlinear optimization., Multiple shooting applied to robust reservoir control optimization including output constraints on coherent risk measures, Switching stepsize strategies for sequential quadratic programming, Nonlinear robust optimization via sequential convex bilevel programming, Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems., Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function, A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization, Unnamed Item, An inexact line search approach using modified nonmonotone strategy for unconstrained optimization, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function, Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review, The solution of some difficult problems in low-thrust interplanetary trajectory optimization, An adaptively regularized sequential quadratic programming method for equality constrained optimization, An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems, Nonmonotone trust region methods with curvilinear path in unconstrained optimization, The Sequential Quadratic Programming Method, On the local and global convergence of a reduced Quasi-Newton method1, Stability and performance guarantees for model predictive control algorithms without terminal constraints, An interior-point algorithm for nonlinear minimax problems, A new nonmonotone line-search trust-region approach for nonlinear systems, A nonmonotone filter method for nonlinear optimization, Global convergence of nonmonotone descent methods for unconstrained optimization problems, A reduced Hessian SQP method for inequality constrained optimization, A new successive quadratic programming algorithm, An interior-point piecewise linear penalty method for nonlinear programming, A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity, A new trust region method for solving least-square transformation of system of equalities and inequalities, Global and local convergence of a filter line search method for nonlinear programming, A class on nonmonotone stabilization methods in unconstrained optimization, Exact penalty function algorithm with simple updating of the penalty parameter, Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs, On efficiency of nonmonotone Armijo-type line searches, A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems, An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization, A global hybrid derivative-free method for high-dimensional systems of nonlinear equations, Nonmonotone line search algorithm for constrained minimax problems, Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods, A globalization procedure for solving nonlinear systems of equations, On the Local Convergence of a Penalty-Function-Free SQP Method, An improved nonmonotone adaptive trust region method., A feasible and superlinear algorithm for inequality constrained minimization problems, COMBINATION ADAPTIVE TRUST REGION METHOD BY NON-MONOTONE STRATEGY FOR UNCONSTRAINED NONLINEAR PROGRAMMING, A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations, Revisions of constraint approximations in the successive QP method for nonlinear programming problems, A BFGS trust-region method with a new nonmonotone technique for nonlinear equations, Globally convergent interior-point algorithm for nonlinear programming, A new technique for inconsistent QP problems in the SQP method, A globally and superlinearly convergent feasible QP-free method for nonlinear programming, Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods, An algorithm for composite nonsmooth optimization problems, Sequential quadratic programming for large-scale nonlinear optimization, A reduced Hessian method for constrained optimization, A quadratic approximation method for minimizing a class of quasidifferentiable functions, Primal-dual Newton-type interior-point method for topology optimization, Local properties of algorithms for minimizing nonsmooth composite functions, A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems, Complementarity problems in GAMS and the PATH solver, A globally convergent algorithm for nonlinearly constrained optimization problems, Nonmonotonic trust region algorithm, Equality and inequality constrained optimization algorithms with convergent stepsizes, Nonmonotone line search for minimax problems, Combining line search and trust-region methods forℓ1-minimization
