Trajectory-following algorithms for min-max optimization problems

DOI10.1007/BF00940489zbMath0797.90099OpenAlexW2021961820MaRDI QIDQ1321272

Thomas L. Vincent, Kok Lay Teo, Bean San Goh

Publication date: 25 October 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940489

zbMATH Keywords

boundedness constraintsnonlinear minimum-maximum optimizationsufficient conditions for global convergencetrajectory-following algorithms

Mathematics Subject Classification ID

Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

Modelling and computation of liquid crystals ⋮ Gradient-flow approach for computing a nonlinear-quadratic optimal-output feedback gain matrix ⋮ Algorithms for unconstrained optimization problems via control theory ⋮ Optimal controller tuning for nonlinear processes ⋮ An optimization framework of biological dynamical systems ⋮ Dynamic search trajectory methods for global optimization ⋮ On the placement of open-loop robotic manipulators for reachability ⋮ Min-max optimization of several classical discrete optimization problems ⋮ Reference variable methods of solving min-Max optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• A multi-start global minimization algorithm with dynamic search trajectories
• Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
• A trajectory-followed method for unconstrained optimization
• On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
• Profit maximization through advertising: A nonzero sum differential game approach

This page was built for publication: Trajectory-following algorithms for min-max optimization problems