An Outer Approximation Algorithm for Solving General Convex Programs
From MaRDI portal
Cited in
(19)- Outer approximation by polyhedral convex sets
- Prox-regularization and solution of ill-posed elliptic variational inequalities
- Some outer approximation methods for semi-infinite optimization problems
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- A relaxed projection method for solving multiobjective optimization problems
- On variable-step relaxed projection algorithm for variational inequalities
- A continuation method for monotone variational inequalities
- Circumcentering approximate reflections for solving the convex feasibility problem
- Full convergence of an approximate projection method for nonsmooth variational inequalities
- Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces
- An explicit algorithm for monotone variational inequalities
- A relaxed projection method for variational inequalities
- On an outer approximation concept in global optimization
- An explicit extragradient algorithm for solving variational inequality problem with application
- Local linear convergence of an outer approximation projection method for variational inequalities
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- A Levenberg-Marquardt method with approximate projections
- On the convergence of a class of outer approximation algorithms for convex programs
- Convergence of direct methods for paramonotone variational inequalities
This page was built for publication: An Outer Approximation Algorithm for Solving General Convex Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3959748)
