Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp

DOI10.1080/00207727608941924zbMath0349.90108OpenAlexW2045691556MaRDI QIDQ4120323

No author found.

Publication date: 1976

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207727608941924

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

A branch-and-bound algorithm for bound constrained optimization problems without derivatives, Algorithms with adaptive smoothing for finite minimax problems, Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution, A constrained min-max algorithm for rival models of the same economic system, Nondifferentiable optimization via smooth approximation: General analytical approach, Non-linear programming using least pth optimization with extrapolation†, Acceleration of the leastpth algorithm for minimax optimization with engineering applications, Optimization of electrical circuits, Nonlinear leastpth optimization and nonlinear programming, A method for convex black-box integer global optimization, Unnamed Item, Yield design theory: An efficient static method formulation, A smoothing-out technique for min—max optimization, An algorithm for composite nonsmooth optimization problems, Solution of minimax problems using equivalent differentiable functions

Cites Work

• Unconstrained optimization based on homogeneous models
• An Algorithm for Minimax Approximation in the Nonlinear Case
• A new approach to variable metric algorithms
• Unnamed Item
• Unnamed Item