Optimization algorithms and point-to-set-maps

DOI10.1007/BF01580449zbMath0312.90052MaRDI QIDQ4070640

P. Huard

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items (13)

Function of region ⋮ Continuousization of the family of point-to-set maps and its applications ⋮ Finding second-order stationary points in constrained minimization: a feasible direction approach ⋮ A convergence theorem of Rosen’s gradient projection method ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ Remarks on the convergence of Rosen's gradient projection method ⋮ Discussion on the convergence of Rosen's gradient projection method ⋮ Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes ⋮ Implementation of gradient methods by tangential discretization ⋮ Algorithmes pour suites non convergentes ⋮ Global convergence of Rosen's gradient projection method ⋮ Stability of the extreme point set of a polyhedron ⋮ Some notions of nonstationary multistep iteration processes

Cites Work

• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Programmation mathématique convexe
• The Validity of a Family of Optimization Methods
• Iterative Solution of Nonlinear Optimal Control Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimization algorithms and point-to-set-maps