Pages that link to "Item:Q3934163"
From MaRDI portal
The following pages link to The watchdog technique for forcing convergence in algorithms for constrained optimization (Q3934163):
Displaying 50 items.
- An efficient nonmonotone trust-region method for unconstrained optimization (Q411524) (← links)
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
- A reduced Hessian SQP method for inequality constrained optimization (Q540630) (← links)
- An interior-point piecewise linear penalty method for nonlinear programming (Q543401) (← links)
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- A nonmonotone trust region method with adaptive radius for unconstrained optimization problems (Q611316) (← links)
- Switching stepsize strategies for sequential quadratic programming (Q635801) (← links)
- A nonmonotone filter method for nonlinear optimization (Q694518) (← links)
- Global convergence of nonmonotone descent methods for unconstrained optimization problems (Q697549) (← links)
- A simple feasible SQP algorithm for inequality constrained optimization (Q858743) (← links)
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function (Q911471) (← links)
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555) (← links)
- An interior-point algorithm for nonlinear minimax problems (Q963659) (← links)
- An algorithm for composite nonsmooth optimization problems (Q1057188) (← links)
- A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
- A globally convergent algorithm for nonlinearly constrained optimization problems (Q1071653) (← links)
- Experiments with successive quadratic programming algorithms (Q1090233) (← links)
- A sparse sequential quadratic programming algorithm (Q1095793) (← links)
- A truncated Newton method with non-monotone line search for unconstrained optimization (Q1095799) (← links)
- Recent developments in constrained optimization (Q1112728) (← links)
- Enlarging the region of convergence of Newton's method for constrained optimization (Q1149235) (← links)
- Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review (Q1184534) (← links)
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems (Q1194855) (← links)
- Nonmonotone trust region methods with curvilinear path in unconstrained optimization (Q1195967) (← links)
- A new successive quadratic programming algorithm (Q1210225) (← links)
- A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
- A reduced Hessian method for constrained optimization (Q1312087) (← links)
- Nonmonotonic trust region algorithm (Q1321301) (← links)
- Equality and inequality constrained optimization algorithms with convergent stepsizes (Q1321310) (← links)
- Nonmonotone line search for minimax problems (Q1321311) (← links)
- A class of nonmonotone stabilization trust region methods (Q1337634) (← links)
- An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point (Q1367215) (← links)
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints (Q1372561) (← links)
- Canonical coordinates method for equality-constrained nonlinear optimization. (Q1406229) (← links)
- Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems. (Q1412598) (← links)
- A feasible and superlinear algorithm for inequality constrained minimization problems (Q1568229) (← links)
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations (Q1576323) (← links)
- Sequential quadratic programming for large-scale nonlinear optimization (Q1593815) (← links)
- Complementarity problems in GAMS and the PATH solver (Q1605705) (← links)
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints (Q1675425) (← links)
- Multiple shooting applied to robust reservoir control optimization including output constraints on coherent risk measures (Q1702390) (← links)
- Nonmonotone line search algorithm for constrained minimax problems (Q1812065) (← links)
- A globalization procedure for solving nonlinear systems of equations (Q1815701) (← links)
- Primal-dual Newton-type interior-point method for topology optimization (Q1862194) (← links)
- Nonmonotone trust region method for solving optimization problems (Q1886565) (← links)
- A successive quadratic programming method that uses new corrections for search directions (Q1919937) (← links)
- A new nonmonotone line-search trust-region approach for nonlinear systems (Q2001862) (← links)
- A new trust region method for solving least-square transformation of system of equalities and inequalities (Q2017830) (← links)
- A penalty-free method with superlinear convergence for equality constrained optimization (Q2191791) (← links)