Pages that link to "Item:Q1300271"

The following pages link to Proximal quasi-Newton methods for nondifferentiable convex optimization (Q1300271):

Displaying 36 items.

• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
• An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
• Regularizations for stochastic linear variational inequalities (Q481768) (← links)
• An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
• On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165) (← links)
• An approximate proximal-extragradient type method for monotone variational inequalities (Q703662) (← links)
• A bundle modification strategy for convex minimization (Q869143) (← links)
• A quasi-Newton bundle method based on approximate subgradients (Q874359) (← links)
• On superlinear convergence of quasi-Newton methods for nonsmooth equations (Q1362530) (← links)
• Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
• A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
• A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization (Q1716990) (← links)
• Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
• On the resolution of the variational inequalities of the first and the second kind as equations obtained by explicit Moreau-Yosida regularizations (Q2156340) (← links)
• The developments of proximal point algorithms (Q2158107) (← links)
• A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
• Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing (Q2243965) (← links)
• On the convergence of a multigrid method for Moreau-regularized variational inequalities of the second kind (Q2305551) (← links)
• Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
• Comparison of two proximal point algorithms for monotone variational inequalities (Q2469901) (← links)
• Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
• A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
• A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
• A modified conjugate gradient method for general convex functions (Q2699981) (← links)
• Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs (Q2797758) (← links)
• Survey of Bundle Methods for Nonsmooth Optimization (Q4806340) (← links)
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)
• The indefinite proximal point algorithms for maximal monotone operators (Q5009166) (← links)
• An efficient conjugate gradient method with strong convergence properties for non-smooth optimization (Q5025110) (← links)
• An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming (Q5124003) (← links)
• An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration (Q5231671) (← links)
• A memory gradient method for non-smooth convex optimization (Q5266154) (← links)
• Variable metric forward–backward splitting with applications to monotone inclusions in duality (Q5495591) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• A \(J\)-symmetric quasi-Newton method for minimax problems (Q6120841) (← links)