Solving variational inequalities defined on a domain with infinitely many linear constraints
From MaRDI portal
Publication:2642631
DOI10.1007/s10589-007-9013-4zbMath1116.49005OpenAlexW2145493348MaRDI QIDQ2642631
Shu-Cherng Fang, Ş. İlker Birbil, Soon-Yi Wu
Publication date: 17 August 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://repub.eur.nl/pub/219/ERS-2002-70-LIS.pdf
Semi-infinite programmingVariational inequality problemDiscretization methodAnalytic center based cutting plane method
Variational inequalities (49J40) Linear systems in control theory (93C05) Semi-infinite programming (90C34)
Related Items (7)
Relaxation methods for solving linear inequality systems: converging results ⋮ A relaxation method for solving systems with infinitely many linear inequalities ⋮ A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations ⋮ Selected applications of linear semi-infinite systems theory ⋮ A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations ⋮ Solving a class of semi-infinite variational inequality problems via a homotopy method ⋮ Rate of convergence of a class of numerical methods solving linear inequality systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Solvability of variational inequality problems
- Newton's method for convex programming and Tschebyscheff approximation
- Exceptional family of elements for a variational inequality problem and its applications
- An analytic center cutting plane method for pseudomonotone variational inequalities
- Entropy optimization and mathematical programming
- A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
- An analytic center cutting plane method for solving semi-infinite variational inequality problems
- An electromagnetism-like mechanism for global optimization
- A unifying geometric solution framework and complexity analysis for variational inequalities
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- A cutting-plane method for quadratic semi infinite programming problems
- A central cutting plane algorithm for the convex programming problem
- An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- The Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequality Problems
- The Supporting Hyperplane Method for Unimodal Programming
- A cutting plane method for solving quasimonotone variational inequalities
This page was built for publication: Solving variational inequalities defined on a domain with infinitely many linear constraints
