Pages that link to "Item:Q703165"
From MaRDI portal
The following pages link to Solving continuous min-max problems by an iterative entropic regularization method. (Q703165):
Displaying 13 items.
- A computational algorithm for selecting robust designs in safety and quality critical processes (Q641802) (← links)
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios (Q852112) (← links)
- Compensated convexity and its applications (Q935274) (← links)
- An entropy regularization technique for minimizing a sum of Tchebycheff norms (Q969313) (← links)
- An inexact proximal point method for solving generalized fractional programs (Q1024832) (← links)
- Generic algorithm for generalized fractional programming (Q1029285) (← links)
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints (Q1293959) (← links)
- On the entropic regularization method for solving min-max problems with applications (Q1366322) (← links)
- Solving min-max problems and linear semi-infinite programs (Q1816663) (← links)
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints (Q2143822) (← links)
- (Q3384760) (← links)
- Robust optimal control: low-error operation for the longest time (Q3577875) (← links)
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm (Q6160427) (← links)
