Pages that link to "Item:Q3959748"

The following pages link to An Outer Approximation Algorithm for Solving General Convex Programs (Q3959748):

Displaying 16 items.

• Local linear convergence of an outer approximation projection method for variational inequalities (Q650239) (← links)
• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
• A Levenberg-Marquardt method with approximate projections (Q742291) (← links)
• On the convergence of a class of outer approximation algorithms for convex programs (Q789154) (← links)
• Convergence of direct methods for paramonotone variational inequalities (Q975354) (← links)
• Outer approximation by polyhedral convex sets (Q1101351) (← links)
• Prox-regularization and solution of ill-posed elliptic variational inequalities (Q1265616) (← links)
• Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
• A relaxed projection method for solving multiobjective optimization problems (Q1752157) (← links)
• On variable-step relaxed projection algorithm for variational inequalities (Q1763409) (← links)
• A continuation method for monotone variational inequalities (Q1908015) (← links)
• Circumcentering approximate reflections for solving the convex feasibility problem (Q2138461) (← links)
• Full convergence of an approximate projection method for nonsmooth variational inequalities (Q2228645) (← links)
• Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces (Q2249816) (← links)
• An explicit algorithm for monotone variational inequalities (Q3165902) (← links)