On a class fo hybrid methods for smooth constrained optimization
type: Item
instance of: scholarly article
title: On a class fo hybrid methods for smooth constrained optimization
zbMATH Open document ID: 0794.90064
DOI: 10.1007/BF00940052
author: V. Pereyra
published in: Journal of Optimization Theory and Applications
publication date: 1994-08-31T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 557709
zbMATH Keywords: smooth nonlinearly constrained optimization
zbMATH Keywords: locally superlinearly convergent methods
zbMATH Keywords: hybrid algorithms
MaRDI profile type: Publication
cites work: Q5652137
cites work: Ein implementierbares einbettungsverfahren der nichttinearen optimierang
cites work: A globally convergent algorithm based on imbedding and parametric optimization
cites work: A globally convergent method for nonlinear programming
cites work: Zur globalen konvergenz des gedämpften wilsonverfahrens
cites work: On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
cites work: Q3882253
cites work: Q4739659
cites work: Revisions of constraint approximations in the successive QP method for nonlinear programming problems
cites work: On the global stabilization of locally convergent algorithms
cites work: A quadratically-convergent algorithm for general nonlinear programming problems
cites work: On the global and superlinear convergence of a discretized version of Wilson's method
cites work: A New Algorithm for Unconstrained Optimization
cites work: A robust secant method for optimization problems with inequality constraints
cites work: Combined phase I—phase II methods of feasible directions
cites work: Q3743121
cites work: A globally and quadratically convergent algorithm for general nonlinear programming problems
cites work: Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives
cites work: A hybrid method fur linearly constrained optimisation problems
cites work: On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
cites work: Newton-type methods for nonlinearly constrained programming problems-algorithms and theory
cites work: Equivalence of the Complementarity Problem to a System of Nonlinear Equations
cites work: Note on the equivalence of Kuhn-Tucker complementarity conditions to an equation
cites work: Continuous deformation of nonlinear programs
cites work: Q3735488
cites work: Verfahren der zulässigen riehtungeh unter rexmtzung reduzierter gradienten für niehtllneare optimierungsprobleme
cites work: A note on a globalization of Wilson-type optimization methods
description: scientific article; zbMATH DE number 557709