Pages that link to "Item:Q963659"

The following pages link to An interior-point algorithm for nonlinear minimax problems (Q963659):

Displaying 16 items.

• 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)
• On solving large-scale finite minimax problems using exponential smoothing (Q535071) (← links)
• New exact penalty function for solving constrained finite min-max problems (Q764635) (← links)
• An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
• A QP-free algorithm for finite minimax problems (Q1724124) (← links)
• Convergence of an interior point algorithm for continuous minimax (Q1956470) (← links)
• An active-set algorithm and a trust-region approach in constrained minimax problem (Q1993563) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• Improved filter-SQP algorithm with active set for constrained minimax problems (Q2336309) (← links)
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems (Q2439373) (← links)
• An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems (Q2687444) (← links)
• A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems (Q5881251) (← links)