Pages that link to "Item:Q979271"
From MaRDI portal
The following pages link to A truncated aggregate smoothing Newton method for minimax problems (Q979271):
Displayed 14 items.
- A homotopy method based on penalty function for nonlinear semidefinite programming (Q496592) (← links)
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
- A spline smoothing Newton method for finite minimax problems (Q525261) (← links)
- An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
- Flattened aggregate function method for nonlinear programming with many complicated constraints (Q2219438) (← links)
- Zero duality gap in surrogate constraint optimization: a concise review of models (Q2255935) (← links)
- The optimality conditions for generalized minimax programming (Q2453279) (← 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)
- An aggregate homotopy method for solving unconstrained minimax problems (Q5009167) (← links)
- Truncated aggregate homotopy method for nonconvex nonlinear programming (Q5746690) (← links)
- (Q6188231) (← links)