Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
From MaRDI portal
Publication:4120323
DOI10.1080/00207727608941924zbMATH Open0349.90108OpenAlexW2045691556MaRDI QIDQ4120323FDOQ4120323
Authors:
Publication date: 1976
Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207727608941924
Cites Work
Cited In (15)
- An algorithm for composite nonsmooth optimization problems
- A smoothing-out technique for min—max optimization
- Algorithms with adaptive smoothing for finite minimax problems
- Optimization of electrical circuits
- Yield design theory: An efficient static method formulation
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- Nonlinear leastpth optimization and nonlinear programming
- Title not available (Why is that?)
- Nondifferentiable optimization via smooth approximation: General analytical approach
- A method for convex black-box integer global optimization
- Solution of minimax problems using equivalent differentiable functions
- Non-linear programming using least pth optimization with extrapolation†
- 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
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
This page was built for publication: Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120323)
