Nonlinear complementarity as unconstrained and constrained minimization

DOI10.1007/BF01585171MaRDI QIDQ1321650zbMATH OpenOpenAlexFDO

Authors O. L. Mangasarian, M. V. Solodov

Publication date 28 April 1994

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01585171

zbMATH Keywords

monotonicitydifferentiabilityduality resultsquasi-Newton methodnonlinear complementarity

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Nonlinear complementarity as unconstrained optimization
• On the resolution of monotone complementarity problems
• Unconstrained minimization approaches to nonlinear complementarity problems
• An unconstrained optimization technique for nonsmooth nonlinear complementarity problems

Cites work

• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3532748 (Why is no real title available?)
• scientific article; zbMATH DE number 3284926 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3393631 (Why is no real title available?)
• A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
• A duality theorem for non-linear programming
• An exact penalty function method with global convergence properties for nonlinear programming problems
• EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
• Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
• Error bounds for monotone linear complementarity problems
• Exact Penalty Functions in Constrained Optimization
• Exact penalty functions in nonlinear programming
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Gauss-Newton methods for the complementarity problem
• Global error bounds for monotone affine variational inequality problems
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• New Error Bounds for the Linear Complementarity Problem
• Newton's Method for B-Differentiable Equations
• Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
• Nonlinear Programs with Positively Bounded Jacobians
• The multiplier method of Hestenes and Powell applied to convex programming
• The nonlinear complementarity problem, with applications. I
• Variational principles for variational inequalities

Cited in

(90)

• A semidefinite method for tensor complementarity problems
• An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method
• Numerical integration of rate-independent BCC single crystal plasticity models: comparative study of two classes of numerical algorithms
• Stationary points of bound constrained minimization reformulations of complementarity problems
• A pathsearch damped Newton method for computing general equilibria
• Improved inexact alternating direction methods for a class of nonlinear complementarity problems
• A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations
• Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method
• On generalized convexity of nonlinear complementarity functions
• On the characterization of quadratic splines
• Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
• The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem
• Modified extragradient method for variational inequalities and verification of solution existence
• A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics
• Merit functions: a bridge between optimization and equilibria
• The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems
• A new smoothing method for solving nonlinear complementarity problems
• Solution of linear complementarity problems using minimization with simple bounds
• New constrained optimization reformulation of complementarity problems
• Smoothing SQP algorithm for semismooth equations with box constraints
• Derivative-free methods for monotone variational inequality and complementarity problems
• Convexity of the implicit Lagrangian
• Global method for monotone variational inequality problems with inequality constraints
• A family of NCP functions and a descent method for the nonlinear complementarity problem
• Error bounds for analytic systems and their applications
• Unconstrained optimization reformulations of variational inequality problems
• Error bounds in mathematical programming
• Growth behavior of two classes of merit functions for symmetric cone complementarity problems
• Merit functions and error bounds for constrained mixed set-valued variational inequalities via generalized \(f\)-projection operators
• Three classes of merit functions for the complementarity problem over a closed convex cone
• Gap functions and global error bounds for set-valued variational inequalities
• Merit functions: a bridge between optimization and equilibria
• A new class of smoothing functions and a smoothing Newton method for complementarity problems
• Tikhonov regularization methods for variational inequality problems
• On minimizing the implicit Lagrangian for nonlinear complementarity problems under \(H\)-differentiability
• Solution of monotone complementarity problems with locally Lipschitzian functions
• New NCP-functions and their properties
• On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability
• Neural network approaches based on new NCP-functions for solving tensor complementarity problem
• On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems
• SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
• Equivalence of variational inequality problems to unconstrained minimization
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• Merit functions and error bounds for generalized variational inequalities.
• Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
• On the resolution of monotone complementarity problems
• A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
• A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
• VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
• On stationary points of the implicit Lagrangian for nonlinear complementarity problems
• Nonlinear complementarity as unconstrained optimization
• Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
• Neural networks for nonlinear and mixed complementarity problems and their applications
• Global method for monotone variational inequality probelms on polyhedral sets
• Merit functions for nonsmooth complementarity problems and related descent algorithms
• Smooth twin support vector machines via unconstrained convex minimization
• On the natural merit function for solving complementarity problems
• A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations
• A penalty approximation method for a semilinear parabolic double obstacle problem
• Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
• A modulus-based nonmonotone line search method for nonlinear complementarity problems
• Generalized dual to the monotone nonlinear complementarity problem
• An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems
• Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
• Properties of restricted NCP functions for nonlinear complementarity problems
• Relaxed projection methods for solving variational inequality problems
• Growth behavior of a class of merit functions for the nonlinear complementarity problem
• Unconstrained minimization approaches to nonlinear complementarity problems
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• Convergence analysis of a trust-region multidimensional filter method for nonlinear complementarity problems
• An unconstrained differentiable penalty method for implicit complementarity problems
• A continuation method for monotone variational inequalities
• New merit functions for multiobjective optimization and their properties
• A penalty approach to a discretized double obstacle problem with derivative constraints
• An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function
• A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems
• On a semismooth least squares formulation of complementarity problems with gap reduction
• New smooth C-functions for symmetric cone complementarity problems
• Trust-region method for box-constrained semismooth equations and its applications to complementary problems
• On unconstrained and constrained stationary points of the implicit Lagrangian
• A new class of neural networks for NCPs using smooth perturbations of the natural residual function
• On merit functions for \(p\)-order cone complementarity problem
• Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities
• A one-parametric class of merit functions for the symmetric cone complementarity problem
• A new semismooth Newton method for NCPs based on the penalized KK function
• Properties and construction of NCP functions
• Integral global optimization method for solution of nonlinear complementarity problems
• Unconstrained global optimization using strict complementary slackness
• On the solution of bounded and unbounded mixed complementarity problems
• A new semismooth Newton method for solving finite-dimensional quasi-variational inequalities

Describes a project that uses

Uses Software

• MINOS

This page was built for publication: Nonlinear complementarity as unconstrained and constrained minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321650)