Equivalence of the Complementarity Problem to a System of Nonlinear Equations

From MaRDI portal
Publication:4108153

DOI10.1137/0131009zbMath0339.90051OpenAlexW1972867892MaRDI QIDQ4108153

Olvi L. Mangasarian

Publication date: 1976

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/57896



Related Items

Differentiability v.s. convexity for complementarity functions, Geometric views of the generalized fischer-burmeister function and its induced merit function, A pathsearch damped Newton method for computing general equilibria, ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION, An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function, A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems, Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems, A numerical embedding method for solving the nonlinear optimization problem, Probability-one homotopy methods for constrained clustering, Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems, Solution of monotone complementarity problems with locally Lipschitzian functions, A new simple homotopy algorithm for linear programming. I, A Newton's method for perturbed second-order cone programs, A constrained optimization approach to solving certain systems of convex equations, A variable dimension solution approach for the general spatial price equilibrium problem, A Newton-type method for positive-semidefinite linear complementarity problems, A continuation method for monotone variational inequalities, Nonlinear complementarity as unconstrained optimization, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Convergence analysis of Gauss-Newton methods for the complementarity problem, A smooth system of equations approach to complementarity problems for frictionless contacts, Homotopy curve tracking in approximate interior point optimization, A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics, Topology optimization of structures in unilateral contact, Optimal control formulation for complementarity dynamical systems, Merit functions for nonsmooth complementarity problems and related descent algorithms, The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints, Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds, A nonlinear complementarity approach for elastoplastic problems by BEM without internal cells, Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems, Note on the equivalence of Kuhn-Tucker complementarity conditions to an equation, Modern homotopy methods in optimization, A smoothing method for zero--one constrained extremum problems, A new class of penalized NCP-functions and its properties, Discovery of new complementarity functions for NCP and SOCCP, A semidefinite method for tensor complementarity problems, A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function, Iterative algorithms for the linear complementarity problem, Numerical aspects of non-smooth multibody dynamics, A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs, On construction of new NCP functions, A note on stability for risk-averse stochastic complementarity problems, Newton's method for linear complementarity problems, Foreword: special issue for the 70th birthday of professor Olvi Mangasarian, Properties and construction of NCP functions, On generalized convexity of nonlinear complementarity functions, A merit function method for infinite-dimensional SOCCPs, On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints, DYNAMICS OF MULTIBODY SYSTEMS WITH UNILATERAL CONSTRAINTS, Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach, A continuation method for solving convex programming problemsviafischer reformulation, Symmetrization of generalized natural residual function for NCP, A framework of time integration methods for nonsmooth systems with unilateral constraints, Computational experience with the Chow—Yorke algorithm, A family of NCP functions and a descent method for the nonlinear complementarity problem, Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems, Risk-Averse Models in Bilevel Stochastic Linear Programming, Merit functions in vector optimization, New constrained optimization reformulation of complementarity problems, On finite termination of an iterative method for linear complementarity problems, On the resolution of monotone complementarity problems, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, A global continuation algorithm for solving binary quadratic programming problems, A homotopy continuation method for solving normal equations, Growth behavior of a class of merit functions for the nonlinear complementarity problem, A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets, Global Newton-type methods and semismooth reformulations for NCP, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, On a class fo hybrid methods for smooth constrained optimization, Gauss-Newton methods for the complementarity problem, Nonlinear complementarity as unconstrained and constrained minimization