On solving large-scale finite minimax problems using exponential smoothing
From MaRDI portal
Publication:535071
Recommendations
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 46849 (Why is no real title available?)
- scientific article; zbMATH DE number 2068041 (Why is no real title available?)
- scientific article; zbMATH DE number 194432 (Why is no real title available?)
- scientific article; zbMATH DE number 895357 (Why is no real title available?)
- A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
- A smoothing trust-region Newton-CG method for minimax problem
- A superlinearly convergent sequential quadratic programming algorithm for minimax problems
- Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
- Algorithms with adaptive smoothing for finite minimax problems
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- An improved SQP algorithm for solving minimax problems
- An interior-point algorithm for nonlinear minimax problems
- Augmented self-concordant barriers and nonlinear optimization problems with finite complexity
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- On complexity of the translational-cut algorithm for convex minimax problems
- On the complexity of the exchange algorithm for minimax optimization problems
- On the convergence of the Pshenichnyi-Pironneau-Polak minimax algorithm with an active set strategy
- On the rate of convergence of two minimax algorithms
- Optimization. Algorithms and consistent approximations
- Portfolio optimization under a minimax rule
- Smoothing method for minimax problems
Cited in
(25)- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems
- A QP-free algorithm for finite minimax problems
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions
- A level-set method for convex optimization with a feasible solution path
- Algorithms with adaptive smoothing for finite minimax problems
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- Convex optimization for group feature selection in networked data
- Making decision trees feasible in ultrahigh feature and label dimensions
- Optimality functions in stochastic programming
- Pattern search methods for finite minimax problems
- Solving implicit mathematical programs with fuzzy variational inequality constraints based on the method of centres with entropic regularization
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- Group update method for sparse minimax problems
- A smoothing iterative method for the finite minimax problem
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- scientific article; zbMATH DE number 7632133 (Why is no real title available?)
- Some computable quasiconvex multiwell models in linear subspaces without rank-one matrices
- On sample size control in sample average approximations for solving smooth stochastic programs
- A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems
- Substitution secant/finite difference method to large sparse minimax problems
- Inexact smoothing method for large scale minimax optimization
- A survey of learning criteria going beyond the usual risk
- A globally convergent QP-free algorithm for inequality constrained minimax optimization
This page was built for publication: On solving large-scale finite minimax problems using exponential smoothing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535071)
