New NCP-functions and their properties
From MaRDI portal
Publication:1367789
DOI10.1023/A:1022659603268zbMath0886.90146OpenAlexW1594537858MaRDI QIDQ1367789
Christian Kanzow, Nobuo Yamashita, Masao Fukushima
Publication date: 19 April 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022659603268
error boundsnonlinear complementarity problemsmerit functionsbounded level setsNCP-functionsunconstrained optimization reformulations
Related Items (43)
Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming ⋮ Geometric views of the generalized fischer-burmeister function and its induced merit function ⋮ 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 ⋮ Error bounds in mathematical programming ⋮ A new method for solving Pareto eigenvalue complementarity problems ⋮ Stationary points of bound constrained minimization reformulations of complementarity problems ⋮ Stationary point conditions for the FB merit function associated with symmetric cones ⋮ A Finsler geometrical programming approach to the nonlinear complementarity problem of traffic equilibrium ⋮ A new class of penalized NCP-functions and its properties ⋮ Nonlinear boundary equation approach for inequality 2-D elastodynamics ⋮ Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method ⋮ A box-constrained differentiable penalty method for nonlinear complementarity problems ⋮ On construction of new NCP functions ⋮ A comparison of solution approaches for the numerical treatment of or-constrained optimization problems ⋮ Robust solution of monotone stochastic linear complementarity problems ⋮ On a semismooth least squares formulation of complementarity problems with gap reduction ⋮ Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems. ⋮ Properties and construction of NCP functions ⋮ On generalized convexity of nonlinear complementarity functions ⋮ On the solution of bounded and unbounded mixed complementarity problems ⋮ The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems ⋮ On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints ⋮ Mean Value Theorems for the Scalar Derivative and Applications ⋮ Symmetrization of generalized natural residual function for NCP ⋮ Convexification method for bilevel programs with a nonconvex Follower's problem ⋮ A linearly convergent derivative-free descent method for the second-order cone complementarity problem ⋮ New constrained optimization reformulation of complementarity problems ⋮ A one-parametric class of merit functions for the symmetric cone complementarity problem ⋮ Derivative-free methods for monotone variational inequality and complementarity problems ⋮ Properties of restricted NCP functions for nonlinear complementarity problems ⋮ Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems ⋮ Growth behavior of two classes of merit functions for symmetric cone complementarity problems ⋮ Variationally consistent discretization schemes and numerical algorithms for contact problems ⋮ Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities ⋮ Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method ⋮ An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function ⋮ Coupled versus decoupled penalization of control complementarity constraints ⋮ SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS ⋮ The convex and monotone functions associated with second-order cone ⋮ 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 ⋮ Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Nonlinear complementarity as unconstrained and constrained minimization
- A semismooth equation approach to the solution of nonlinear complementarity problems
- On unconstrained and constrained stationary points of the implicit Lagrangian
- On the resolution of monotone complementarity problems
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- Nonlinear complementarity as unconstrained optimization
- On P- and S-functions and related classes of \(n\)-dimensional nonlinear mappings
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- Unconstrained minimization approaches to nonlinear complementarity problems
- Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
- A special newton-type optimization method
- Smooth Approximations to Nonlinear Complementarity Problems
- New Error Bounds for the Linear Complementarity Problem
This page was built for publication: New NCP-functions and their properties