scientific article; zbMATH DE number 679864
From MaRDI portal
Publication:4311911
zbMath0818.90086MaRDI QIDQ4311911
Zhi-Quan Luo, Yinyu Ye, Jean-Louis Goffin
Publication date: 30 October 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cutting planesconvex feasibility problemseparation oraclequasiconvex feasibility problemspotential reduction column generation algorithm
Convex programming (90C25) Computational aspects related to convexity (52B55) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Related Items
Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems, Complexity of some cutting plane methods that use analytic centers, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, An analytic center cutting plane method for pseudomonotone variational inequalities, A relaxation method for solving systems with infinitely many linear inequalities, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, A note on some analytic center cutting plane methods for convex feasibility and minimization problems, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, Algorithms for the quasiconvex feasibility problem, Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications
