An Outer Approximation Algorithm for Solving General Convex Programs
From MaRDI portal
Publication:3959748
DOI10.1287/OPRE.31.1.101zbMath0495.90066OpenAlexW2075566691MaRDI QIDQ3959748
Publication date: 1983
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.31.1.101
Related Items (19)
An explicit algorithm for monotone variational inequalities ⋮ Some outer approximation methods for semi-infinite optimization problems ⋮ Circumcentering approximate reflections for solving the convex feasibility problem ⋮ Outer approximation by polyhedral convex sets ⋮ A relaxed projection method for variational inequalities ⋮ A continuation method for monotone variational inequalities ⋮ An explicit extragradient algorithm for solving variational inequality problem with application ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Local linear convergence of an outer approximation projection method for variational inequalities ⋮ Full convergence of an approximate projection method for nonsmooth variational inequalities ⋮ A relaxed projection method for solving multiobjective optimization problems ⋮ Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems ⋮ On an outer approximation concept in global optimization ⋮ Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces ⋮ On variable-step relaxed projection algorithm for variational inequalities ⋮ Convergence of direct methods for paramonotone variational inequalities ⋮ A Levenberg-Marquardt method with approximate projections ⋮ Prox-regularization and solution of ill-posed elliptic variational inequalities ⋮ On the convergence of a class of outer approximation algorithms for convex programs
This page was built for publication: An Outer Approximation Algorithm for Solving General Convex Programs
