Pages that link to "Item:Q3883929"

The following pages link to Variable metric methods for minimizing a class of nondifferentiable functions (Q3883929):

Displaying 39 items.

• A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
• Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
• Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
• A smooth method for the finite minimax problem (Q689121) (← links)
• A modified SQP algorithm for minimax problems (Q837129) (← links)
• A smoothing trust-region Newton-CG method for minimax problem (Q928081) (← links)
• An improved SQP algorithm for solving minimax problems (Q1021864) (← links)
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
• An algorithm for composite nonsmooth optimization problems (Q1057188) (← links)
• A compact variable metric algorithm for nonlinear minimax approximation (Q1062915) (← links)
• A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
• Global convergence of quasi-Newton-type algorithms for some nonsmooth optimization problems (Q1166101) (← links)
• An algorithm for solving linearly constrained minimax problems (Q1169406) (← links)
• A constrained min-max algorithm for rival models of the same economic system (Q1184350) (← links)
• A barrier function method for minimax problems (Q1186276) (← links)
• A projected conjugate gradient method for sparse minimax problems (Q1315210) (← links)
• Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
• Nonmonotone line search for minimax problems (Q1321311) (← links)
• Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
• Discontinuous piecewise linear optimization (Q1380942) (← links)
• Robust min-max portfolio strategies for rival forecast and risk scenarios (Q1583147) (← links)
• Approximation in normed linear spaces (Q1587393) (← links)
• A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities (Q1616935) (← links)
• A QP-free algorithm for finite minimax problems (Q1724124) (← links)
• Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems (Q1824569) (← links)
• A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
• Superlinearly convergent algorithm for min-max problems (Q2277156) (← links)
• A new superlinearly convergent SQP algorithm for nonlinear minimax problems (Q2468786) (← links)
• (Q3340507) (← links)
• (Q3346095) (← links)
• (Q3552458) (← links)
• (Q3725888) (← links)
• (Q3757284) (← links)
• Optimal <i>m</i>‐stage Runge‐Kutta schemes for steady‐state solutions of hyperbolic equations (Q4272871) (← links)
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)
• An aggregate homotopy method for solving unconstrained minimax problems (Q5009167) (← links)
• An Adaptive Smoothing Method for Continuous Minimax Problems (Q5245835) (← links)
• A sequential quadratic programming algorithm for nonlinear minimax problems (Q5301244) (← links)
• Generalised monotone line search algorithm for degenerate nonlinear minimax problems (Q5485718) (← links)