Pages that link to "Item:Q535071"

The following pages link to On solving large-scale finite minimax problems using exponential smoothing (Q535071):

Displaying 15 items.

• Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions (Q280969) (← links)
• Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
• Group update method for sparse minimax problems (Q493251) (← links)
• Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems (Q683724) (← links)
• Optimality functions in stochastic programming (Q715095) (← links)
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
• A QP-free algorithm for finite minimax problems (Q1724124) (← links)
• Solving implicit mathematical programs with fuzzy variational inequality constraints based on the method of centres with entropic regularization (Q1794551) (← links)
• Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← links)
• A globally convergent QP-free algorithm for inequality constrained minimax optimization (Q2151966) (← links)
• Flattened aggregate function method for nonlinear programming with many complicated constraints (Q2219438) (← links)
• On sample size control in sample average approximations for solving smooth stochastic programs (Q2376122) (← links)
• Some computable quasiconvex multiwell models in linear subspaces without rank-one matrices (Q2696695) (← links)
• Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
• A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems (Q5881251) (← links)