Pages that link to "Item:Q3938844"

The following pages link to A bundle type approach to the unconstrained minimization of convex nonsmooth functions (Q3938844):

Displaying 26 items.

• 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 adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
• Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
• A smooth method for the finite minimax problem (Q689121) (← 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 bundle modification strategy for convex minimization (Q869143) (← links)
• Discrete gradient method: Derivative-free method for nonsmooth optimization (Q946181) (← links)
• A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
• Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems (Q1308671) (← links)
• Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
• Smooth transformation of the generalized minimax problem (Q1372537) (← links)
• A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities (Q1616935) (← links)
• A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
• A QP-free algorithm for finite minimax problems (Q1724124) (← links)
• A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056) (← links)
• An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
• A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
• Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
• Tuning strategy for the proximity parameter in convex minimization (Q2370054) (← links)
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems (Q2439373) (← links)
• An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization (Q2483018) (← links)
• An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems (Q2687444) (← links)
• A descent algorithm for nonsmooth convex optimization (Q3337229) (← links)