A method of feasible directions using function approximations, with applications to min max problems

DOI10.1016/0022-247X(73)90233-3zbMath0253.90046MaRDI QIDQ2558245

Yanyan Li

Publication date: 1973

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

A barrier function method for minimax problems ⋮ Minimization methods with constraints ⋮ Perturbation des méthodes d'optimisation. Applications ⋮ A direct method of linearization for continuous minimax problems ⋮ A method of feasible directions using function approximations, with applications to min max problems ⋮ A method of centers algorithm for certain minimax problems ⋮ An \(\epsilon\)-active barrier-function method for solving minimax problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimization of functions having Lipschitz continuous first partial derivatives
• A method of feasible directions using function approximations, with applications to min max problems
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Abstract Models for the Synthesis of Optimization Algorithms
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints