Pages that link to "Item:Q597184"

The following pages link to Algorithms with adaptive smoothing for finite minimax problems (Q597184):

Displaying 49 items.

• Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions (Q280969) (← links)
• A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
• Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
• Inexact smoothing method for large scale minimax optimization (Q425468) (← links)
• A new objective penalty function approach for solving constrained minimax problems (Q489101) (← links)
• Group update method for sparse minimax problems (Q493251) (← links)
• A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
• Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems (Q522420) (← links)
• A spline smoothing Newton method for finite minimax problems (Q525261) (← links)
• On solving large-scale finite minimax problems using exponential smoothing (Q535071) (← links)
• Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques (Q597183) (← links)
• An aggregate deformation homotopy method for min-max-min problems with max-min constraints (Q616792) (← links)
• An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
• A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems (Q839044) (← links)
• A smoothing trust-region Newton-CG method for minimax problem (Q928081) (← links)
• Efficient sample sizes in stochastic nonlinear programming (Q929602) (← links)
• An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems (Q939107) (← links)
• A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
• A smoothing algorithm for finite min-max-min problems (Q1001326) (← links)
• Reference variable methods of solving min-Max optimization problems (Q1024824) (← links)
• A cut-peak function method for global optimization (Q1026439) (← links)
• Error bounds of two smoothing approximations for semi-infinite minimax problems (Q1048250) (← links)
• A QP-free algorithm for finite minimax problems (Q1724124) (← links)
• A geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve (Q1736768) (← links)
• Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← links)
• Convergence of an interior point algorithm for continuous minimax (Q1956470) (← links)
• A globally convergent QP-free algorithm for inequality constrained minimax optimization (Q2151966) (← links)
• Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
• Flattened aggregate function method for nonlinear programming with many complicated constraints (Q2219438) (← links)
• A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
• Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface (Q2333544) (← links)
• A spline smoothing Newton method for semi-infinite minimax problems (Q2336781) (← links)
• Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space (Q2337268) (← links)
• On sample size control in sample average approximations for solving smooth stochastic programs (Q2376122) (← links)
• A simplex grey wolf optimizer for solving integer programming and minimax problems (Q2402871) (← links)
• Recursive approximation of the high dimensional max function (Q2488194) (← links)
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
• An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems (Q2687444) (← links)
• Hyperbolic smoothing function method for minimax problems (Q2841156) (← links)
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)
• (Q3552458) (← links)
• An aggregate homotopy method for solving unconstrained minimax problems (Q5009167) (← links)
• (Q5055095) (← links)
• An Approximation Scheme for Distributionally Robust PDE-Constrained Optimization (Q5081087) (← links)
• An Approximation Scheme for Distributionally Robust Nonlinear Optimization (Q5116546) (← links)
• An Adaptive Smoothing Method for Continuous Minimax Problems (Q5245835) (← links)
• Direct Gravitational Search Algorithm for Global Optimisation Problems (Q5372051) (← links)
• Consistent approximations in composite optimization (Q6165588) (← links)