Pages that link to "Item:Q1896573"

The following pages link to Some properties of generalized proximal point methods for quadratic and linear programming (Q1896573):

Displaying 16 items.

• A proximal method with logarithmic barrier for nonlinear complementarity problems (Q280087) (← links)
• On a generalized proximal point method for solving equilibrium problems in Banach spaces (Q714471) (← links)
• Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
• A generalized proximal-point-based prediction-correction method for variational inequality problems (Q950089) (← links)
• Equilibrium programming using proximal-like algorithms (Q1373724) (← links)
• On some properties of generalized proximal point methods for variational inequalities (Q1389080) (← links)
• A note on the existence of zeroes of convexly regularized sums of maximal monotone operators (Q1873664) (← links)
• An interior point-proximal method of multipliers for convex quadratic programming (Q2028483) (← links)
• Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming (Q2420822) (← links)
• Inexact proximal point algorithms and descent methods in optimization (Q2575251) (← links)
• INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (Q2769521) (← links)
• Proximal Methods with Penalization Effects in Banach Spaces (Q3157819) (← links)
• Newton-type Methods with Generalized Distances For Constrained Optimization (Q4361042) (← links)
• Re-examination of Bregman functions and new properties of their divergences (Q4613995) (← links)
• On inexact generalized proximal methods with a weakened error tolerance criterion (Q4656055) (← links)
• Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227) (← links)