On the convergence of a class of outer approximation algorithms for convex programs
From MaRDI portal
Publication:789154
DOI10.1016/0377-0427(84)90051-7zbMath0532.65047OpenAlexW1963892562MaRDI QIDQ789154
Publication date: 1984
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(84)90051-7
Related Items
Some outer approximation methods for semi-infinite optimization problems, Outer approximation by polyhedral convex sets, A relaxed projection method for variational inequalities, Inertial accelerated algorithms for solving a split feasibility problem, Random and cyclic projection algorithms for variational inequalities, The relaxed inexact projection methods for the split feasibility problem, Several acceleration schemes for solving the multiple-sets split feasibility problem, Regular Sequences of Quasi-Nonexpansive Operators and Their Applications, 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, Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Split Feasibility and Fixed Point Problems, Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton's method for convex programming and Tschebyscheff approximation
- An approach to nonlinear programming
- The Cutting-Plane Method for Solving Convex Programs
- An Outer Approximation Algorithm for Solving General Convex Programs
- Approximate cutting planes in nonlinear programming
- The Supporting Hyperplane Method for Unimodal Programming
- Convergence Conditions for Nonlinear Programming Algorithms
