Continuous min-max programs with semi-infinite constraints
From MaRDI portal
Recommendations
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints
- Solving min-max problems and linear semi-infinite programs
- A maximum entropy method for constrained semi-infinite programming problems
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
- Maxmin subject to marginal constraints
Cites work
- A barrier function method for minimax problems
- A generalization of Polyak's convergence result for subgradient optimization
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- An algorithm for generalized fractional programs
- An iterative method for solving KKT system of the semi-infinite programming
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Entropy optimization and mathematical programming
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 51950 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 3280851 (Why is no real title available?)
- Nondifferentiable optimization. Transl. from the Russian by Tetsushi Sasagawa
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- Optimization. Algorithms and consistent approximations
- Second-order algorithms for generalized finite and semi-infinite min-max problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Smoothing methods for convex inequalities and linear complementarity problems
- Solving continuous min-max problems by an iterative entropic regularization method.
- Solving min-max problems and linear semi-infinite programs
- Superlinearly convergent algorithm for min-max problems
Cited in
(4)- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
- Solving min-max problems and linear semi-infinite programs
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
- An entropic regularized method of centers for continuous minimax problem with semi infinite constraints
This page was built for publication: Continuous min-max programs with semi-infinite constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384760)
