Optimization algorithms and point-to-set-maps

DOI10.1007/BF01580449zbMATH Open0312.90052MaRDI QIDQ4070640FDOQ4070640

Authors: 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)

Cites Work

• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Validity of a Family of Optimization Methods
• Iterative Solution of Nonlinear Optimal Control Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Programmation mathématique convexe
• Title not available (Why is that?)

Cited In (13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4070640)