Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
From MaRDI portal
Publication:4120323
Cites work
- scientific article; zbMATH DE number 3014822 (Why is no real title available?)
- scientific article; zbMATH DE number 3295416 (Why is no real title available?)
- A new approach to variable metric algorithms
- An Algorithm for Minimax Approximation in the Nonlinear Case
- Unconstrained optimization based on homogeneous models
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
- Yield design theory: An efficient static method formulation
- Optimization of electrical circuits
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- Nonlinear leastpth optimization and nonlinear programming
- scientific article; zbMATH DE number 4007605 (Why is no real title available?)
- 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)
