Solving variational inequalities defined on a domain with infinitely many linear constraints
From MaRDI portal
Publication:2642631
Recommendations
- Iterations for solving linear variational inequalities on domains with nonlinear boundaries
- scientific article; zbMATH DE number 5018652
- Variational inequality problems with a continuum of solutions: Existence and computation
- On variational problems with linear constraints
- Solving variational inequality and fixed point problems by line searches and potential optimization
- Solvability of variational inequality problems
- On Optimization Problems with Variational Inequality Constraints
- Variatoinal inequalities and convex semi-infinite programming problems
- Publication:4937580
- scientific article; zbMATH DE number 2186854
Cites work
- A central cutting plane algorithm for the convex programming problem
- A cutting plane method for solving quasimonotone variational inequalities
- A cutting-plane method for quadratic semi infinite programming problems
- A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities
- A unifying geometric solution framework and complexity analysis for variational inequalities
- An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
- An analytic center cutting plane method for pseudomonotone variational inequalities
- An analytic center cutting plane method for solving semi-infinite variational inequality problems
- An electromagnetism-like mechanism for global optimization
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Entropy optimization and mathematical programming
- Exceptional family of elements for a variational inequality problem and its applications
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 1186918 (Why is no real title available?)
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 3238144 (Why is no real title available?)
- Newton's method for convex programming and Tschebyscheff approximation
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- Solvability of variational inequality problems
- The Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequality Problems
- The Supporting Hyperplane Method for Unimodal Programming
Cited in
(8)- Relaxation methods for solving linear inequality systems: converging results
- Selected applications of linear semi-infinite systems theory
- Solving a class of semi-infinite variational inequality problems via a homotopy method
- A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations
- Solving finite-domain linear constraints in presence of the $\texttt{alldifferent}$
- Rate of convergence of a class of numerical methods solving linear inequality systems
- A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations
- A relaxation method for solving systems with infinitely many linear inequalities
This page was built for publication: Solving variational inequalities defined on a domain with infinitely many linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642631)
