scientific article; zbMATH DE number 895357
From MaRDI portal
Publication:4883369
Recommendations
- An interior-point algorithm for nonlinear minimax problems
- A Practical Interior-Point Method for Convex Programming
- scientific article; zbMATH DE number 800120
- scientific article; zbMATH DE number 269555
- Interior-point methods for convex programming
- A dual regularized method for solving a class of convex minimization problems
- Dual versus primal-dual interior-point methods for linear and conic programming
- Dual interior point methods for linear semidefinite programming problems
- scientific article; zbMATH DE number 1047680
- Publication:4937595
Cited in
(5)- On solving large-scale finite minimax problems using exponential smoothing
- Primal interior point method for minimization of generalized minimax functions
- An active set smoothing method for solving unconstrained minimax problems
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- Substitution secant/finite difference method to large sparse minimax problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883369)