AbstractAn underlying general structure of complementary pivot theory is presented with applications to various problems in optimization theory. The applications include linear complementarity, fixed point theory, unconstrained and constrained convex optimization without derivatives, nonlinear complementarity, and saddle point problems
Interior-point algorithms are among the most efficient techniques for solving complementarity proble...
The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasar...
A family of complementarity problems are defined as extensions of the well known Linear Complementar...
AbstractAn underlying general structure of complementary pivot theory is presented with applications...
AbstractA family of algorithms which solve the complementarity problem (and certain generalized comp...
AbstractThis paper provides an introduction to complementarity problems, with an emphasis on applica...
A family of complementarity problems are defined as extensions of the well known Linear Complementar...
The study of complementarity problems is now an interesting mathematical subject with many applicati...
We propose a new approach to convex nonlinear multiobjective optimization that captures the geometry...
International audienceIn this article, we propose a new merit function based on sub-additive functio...
The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtai...
Recent improvements in the capabilities of complementarity solvers have led to an increased interest...
A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem wh...
AbstractWe investigate refinements of an existing nonconvex programming algorithm that exploits spec...
In this paper, we present a new approach in order to solve the linear complementary problem noted (L...
Interior-point algorithms are among the most efficient techniques for solving complementarity proble...
The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasar...
A family of complementarity problems are defined as extensions of the well known Linear Complementar...
AbstractAn underlying general structure of complementary pivot theory is presented with applications...
AbstractA family of algorithms which solve the complementarity problem (and certain generalized comp...
AbstractThis paper provides an introduction to complementarity problems, with an emphasis on applica...
A family of complementarity problems are defined as extensions of the well known Linear Complementar...
The study of complementarity problems is now an interesting mathematical subject with many applicati...
We propose a new approach to convex nonlinear multiobjective optimization that captures the geometry...
International audienceIn this article, we propose a new merit function based on sub-additive functio...
The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtai...
Recent improvements in the capabilities of complementarity solvers have led to an increased interest...
A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem wh...
AbstractWe investigate refinements of an existing nonconvex programming algorithm that exploits spec...
In this paper, we present a new approach in order to solve the linear complementary problem noted (L...
Interior-point algorithms are among the most efficient techniques for solving complementarity proble...
The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasar...
A family of complementarity problems are defined as extensions of the well known Linear Complementar...
DOI
Add to ORKG