Pages that link to "Item:Q4120323"
From MaRDI portal
The following pages link to Non-linear minimax optimization as a sequence of least<i>p</i>th optimization with finite values of<i>p</i> (Q4120323):
Displaying 15 items.
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- An algorithm for composite nonsmooth optimization problems (Q1057188) (← links)
- Solution of minimax problems using equivalent differentiable functions (Q1068355) (← links)
- A constrained min-max algorithm for rival models of the same economic system (Q1184350) (← links)
- Nondifferentiable optimization via smooth approximation: General analytical approach (Q1207839) (← links)
- Yield design theory: An efficient static method formulation (Q1286039) (← links)
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives (Q1904655) (← links)
- A method for convex black-box integer global optimization (Q2045020) (← links)
- Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution (Q2421451) (← links)
- (Q3757284) (← links)
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications (Q3851986) (← links)
- Optimization of electrical circuits (Q3858061) (← links)
- A smoothing-out technique for min—max optimization (Q3922488) (← links)
- Non-linear programming using least pth optimization with extrapolation† (Q4133425) (← links)
- Nonlinear leastpth optimization and nonlinear programming (Q4152045) (← links)
