On a class fo hybrid methods for smooth constrained optimization

Related Items (4)

Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems ⋮ OpTIX-II: A software environment for the parallel solution of nonlinear optimization problems ⋮ An exact penalty-Lagrangian approach for large-scale nonlinear programming ⋮ Global convergence of QPFTH method for large-scale nonlinear sparse constrained optimization

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
A note on a globalization of Wilson-type optimization methods
A robust secant method for optimization problems with inequality constraints
Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives
A globally and quadratically convergent algorithm for general nonlinear programming problems
Note on the equivalence of Kuhn-Tucker complementarity conditions to an equation
On the global and superlinear convergence of a discretized version of Wilson's method
A globally convergent algorithm based on imbedding and parametric optimization
On the global stabilization of locally convergent algorithms
A globally convergent method for nonlinear programming
On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
Ein implementierbares einbettungsverfahren der nichttinearen optimierang
Revisions of constraint approximations in the successive QP method for nonlinear programming problems
Continuous deformation of nonlinear programs
Verfahren der zulässigen riehtungeh unter rexmtzung reduzierter gradienten für niehtllneare optimierungsprobleme
A hybrid method fur linearly constrained optimisation problems
Newton-type methods for nonlinearly constrained programming problems-algorithms and theory
Equivalence of the Complementarity Problem to a System of Nonlinear Equations
Combined phase I—phase II methods of feasible directions
A New Algorithm for Unconstrained Optimization
A quadratically-convergent algorithm for general nonlinear programming problems
Zur globalen konvergenz des gedämpften wilsonverfahrens

This page was built for publication: On a class fo hybrid methods for smooth constrained optimization