A class of smoothing functions for nonlinear and mixed complementarity problems
type: Item
instance of: scholarly article
title: A class of smoothing functions for nonlinear and mixed complementarity problems
zbMATH Open document ID: 0859.90112
DOI: 10.1007/BF00249052
author: Chunhui Chen
author: O. L. Mangasarian
published in: Computational Optimization and Applications
publication date: 1997-04-10T00:00:00Z
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 941328
zbMATH Keywords: smoothing
zbMATH Keywords: parametric smooth functions
zbMATH Keywords: mixed complementarity
describes a project that uses: MINOS
describes a project that uses: PATH Solver
describes a project that uses: MILES
describes a project that uses: MCPLIB
MaRDI profile type: Publication
cites work: Projected Newton Methods for Optimization Problems with Simple Constraints
cites work: A Non-Interior-Point Continuation Method for Linear Complementarity Problems
cites work: Smoothing methods for convex inequalities and linear complementarity problems
cites work: Q3702408
cites work: The Generalized Order Linear Complementarity Problem
cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
cites work: Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
cites work: The relation between the path of centers and Smale's regularization of the linear programming problem
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: Nondifferentiable optimization via smooth approximation: General analytical approach
cites work: A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
cites work: Mathematical Programming in Neural Networks
cites work: The Extended Linear Complementarity Problem
cites work: Global Methods for Nonlinear Complementarity Problems
cites work: Q4039868
cites work: Q5661059
cites work: Newton's Method for B-Differentiable Equations
cites work: A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
cites work: NE/SQP: A robust algorithm for the nonlinear complementarity problem
cites work: On Smoothing Exact Penalty Functions for Convex Constrained Optimization
cites work: Global Convergence of Damped Newton's Method for Nonsmooth Equations via the Path Search
cites work: Generalized equations and their solutions, Part I: Basic theory
cites work: Strongly Regular Generalized Equations
cites work: Q3816922
cites work: A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
cites work: A smoothing-out technique for min—max optimization
description: scientific article; zbMATH DE number 941328