Nonlinear complementarity as unconstrained and constrained minimization
From MaRDI portal
Publication:1321650
DOI10.1007/BF01585171zbMath0813.90117OpenAlexW2107710567MaRDI QIDQ1321650
Olvi L. Mangasarian, Mikhail 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
Related Items
Neural networks for nonlinear and mixed complementarity problems and their applications, A pathsearch damped Newton method for computing general equilibria, Integral global optimization method for solution of nonlinear complementarity problems, Error bounds for analytic systems and their applications, Smoothing SQP algorithm for semismooth equations with box constraints, Solution of linear complementarity problems using minimization with simple bounds, On stationary points of the implicit Lagrangian for nonlinear complementarity problems, An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method, Neural network approaches based on new NCP-functions for solving tensor complementarity problem, Gap functions and global error bounds for set-valued variational inequalities, Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems, Solution of monotone complementarity problems with locally Lipschitzian functions, Unconstrained optimization reformulations of variational inequality problems, On unconstrained and constrained stationary points of the implicit Lagrangian, A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions, Error bounds in mathematical programming, A continuation method for monotone variational inequalities, Nonlinear complementarity as unconstrained optimization, Equivalence of variational inequality problems to unconstrained minimization, Stationary points of bound constrained minimization reformulations of complementarity problems, New NCP-functions and their properties, Convexity of the implicit Lagrangian, Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds, Global method for monotone variational inequality problems with inequality constraints, On minimizing the implicit Lagrangian for nonlinear complementarity problems under \(H\)-differentiability, Modified extragradient method for variational inequalities and verification of solution existence, A modulus-based nonmonotone line search method for nonlinear complementarity problems, A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics, Merit functions for nonsmooth complementarity problems and related descent algorithms, The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem, A new class of smoothing functions and a smoothing Newton method for complementarity problems, Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function, Global method for monotone variational inequality probelms on polyhedral sets, Merit functions and error bounds for generalized variational inequalities., On the natural merit function for solving complementarity problems, A semidefinite method for tensor complementarity problems, Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method, Merit functions: a bridge between optimization and equilibria, A penalty approximation method for a semilinear parabolic double obstacle problem, A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs, A penalty approach to a discretized double obstacle problem with derivative constraints, Trust-region method for box-constrained semismooth equations and its applications to complementary problems, A new semismooth Newton method for NCPs based on the penalized KK function, New smooth C-functions for symmetric cone complementarity problems, Smooth twin support vector machines via unconstrained convex minimization, On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability, Merit functions: a bridge between optimization and equilibria, A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems, A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations, An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems, On a semismooth least squares formulation of complementarity problems with gap reduction, Properties and construction of NCP functions, On generalized convexity of nonlinear complementarity functions, On the solution of bounded and unbounded mixed complementarity problems, Generalized dual to the monotone nonlinear complementarity problem, The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems, Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem, On merit functions for \(p\)-order cone complementarity problem, On the characterization of quadratic splines, A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations, A family of NCP functions and a descent method for the nonlinear complementarity problem, On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems, Merit functions and error bounds for constrained mixed set-valued variational inequalities via generalizedf-projection operators, New constrained optimization reformulation of complementarity problems, A one-parametric class of merit functions for the symmetric cone complementarity problem, VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS, On the resolution of monotone complementarity problems, Derivative-free methods for monotone variational inequality and complementarity problems, Properties of restricted NCP functions for nonlinear complementarity problems, An unconstrained differentiable penalty method for implicit complementarity problems, Growth behavior of two classes of merit functions for symmetric cone complementarity problems, A new semismooth Newton method for solving finite-dimensional quasi-variational inequalities, A new class of neural networks for NCPs using smooth perturbations of the natural residual function, Three classes of merit functions for the complementarity problem over a closed convex cone, Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities, Convergence analysis of a trust-region multidimensional filter method for nonlinear complementarity problems, Growth behavior of a class of merit functions for the nonlinear complementarity problem, An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function, Unconstrained minimization approaches to nonlinear complementarity problems, Equivalence of the generalized complementarity problem to differentiable unconstrained minimization, A new smoothing method for solving nonlinear complementarity problems, SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS, Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function, An unconstrained smooth minimization reformulation of the second-order cone complementarity problem, Tikhonov regularization methods for variational inequality problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Global error bounds for monotone affine variational inequality problems
- Gauss-Newton methods for the complementarity problem
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- The nonlinear complementarity problem, with applications. I
- The multiplier method of Hestenes and Powell applied to convex programming
- Newton's Method for B-Differentiable Equations
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Variational principles for variational inequalities
- A duality theorem for non-linear programming
- Exact penalty functions in nonlinear programming
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
- New Error Bounds for the Linear Complementarity Problem
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Error bounds for monotone linear complementarity problems
- Exact Penalty Functions in Constrained Optimization
- Nonlinear Programs with Positively Bounded Jacobians
