scientific article; zbMATH DE number 844464
From MaRDI portal
Publication:4865357
Recommendations
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- A rapid algorithm for a class of linear complementarity problems
- A projection and contraction method for symmetric cone complementarity problem
- scientific article; zbMATH DE number 1131717
- A self-adaptive projection and contraction method for linear complementarity problems
Cited in
(33)- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- A self-adaptive projection and contraction method for linear complementarity problems
- Projective algorithms for solving complementarity problems
- A variational inequality approach for constrained multifacility Weber problem under gauge
- Some recent advances in projection-type methods for variational inequalities
- A class of projection and contraction methods for asymmetric linear variational inequalities and their relations to Fukushima's descent method
- ADMM-type methods for generalized multi-facility Weber problem
- Projection and contraction method for updating simultaneously mass and stiffness matrices
- Solving a class of constrained `black-box' inverse variational inequalities
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- A rapid algorithm for a class of linear complementarity problems
- On the iteration complexity of some projection methods for monotone linear variational inequalities
- Solving a class of matrix minimization problems by linear variational inequality approaches
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- A new class of projection and contraction methods for solving variational inequality problems
- A new projection and contraction method for linear variational inequalities
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- A generalized Weber problem with different gauges for different regions
- A linear combinatorial projection method for a class of generalized implicit complementarity problems
- Some results concerning the solution mappings of mixed variational inequality problems
- A sequential linear programming method for generalized linear complementarity problem
- scientific article; zbMATH DE number 1294729 (Why is no real title available?)
- scientific article; zbMATH DE number 1131717 (Why is no real title available?)
- Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method
- A projection-type method for the generalized linear complementarity problem over a polyhedral cone
- Self-adaptive inertial projection and contraction algorithm for monotone variational inequality
- Local convergence behavior of some projection-type methods for affine variational inequalities
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities
- Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
- The projection algorithm for inverse quasi-variational inequalities with applications to traffic assignment and network equilibrium control problems
- Minisum location problem with farthest Euclidean distances
- Solving linear variational inequality problems by a self-adaptive projection method
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865357)
