New NCP-functions and their properties

From MaRDI portal
Revision as of 14:55, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (43)

Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programmingGeometric views of the generalized fischer-burmeister function and its induced merit functionON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTIONAn \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit functionError bounds in mathematical programmingA new method for solving Pareto eigenvalue complementarity problemsStationary points of bound constrained minimization reformulations of complementarity problemsStationary point conditions for the FB merit function associated with symmetric conesA Finsler geometrical programming approach to the nonlinear complementarity problem of traffic equilibriumA new class of penalized NCP-functions and its propertiesNonlinear boundary equation approach for inequality 2-D elastodynamicsUnconstrained optimization reformulation of the generalized nonlinear complementarity problem and related methodA box-constrained differentiable penalty method for nonlinear complementarity problemsOn construction of new NCP functionsA comparison of solution approaches for the numerical treatment of or-constrained optimization problemsRobust solution of monotone stochastic linear complementarity problemsOn a semismooth least squares formulation of complementarity problems with gap reductionError bounds for \(R_0\)-type and monotone nonlinear complementarity problems.Properties and construction of NCP functionsOn generalized convexity of nonlinear complementarity functionsOn the solution of bounded and unbounded mixed complementarity problemsThe bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problemsOn the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraintsMean Value Theorems for the Scalar Derivative and ApplicationsSymmetrization of generalized natural residual function for NCPConvexification method for bilevel programs with a nonconvex Follower's problemA linearly convergent derivative-free descent method for the second-order cone complementarity problemNew constrained optimization reformulation of complementarity problemsA one-parametric class of merit functions for the symmetric cone complementarity problemDerivative-free methods for monotone variational inequality and complementarity problemsProperties of restricted NCP functions for nonlinear complementarity problemsProperties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problemsGrowth behavior of two classes of merit functions for symmetric cone complementarity problemsVariationally consistent discretization schemes and numerical algorithms for contact problemsTheoretical and numerical investigation of the D-gap function for box constrained variational inequalitiesReformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton MethodAn efficient neural network for solving convex optimization problems with a nonlinear complementarity problem functionCoupled versus decoupled penalization of control complementarity constraintsSOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMSThe convex and monotone functions associated with second-order coneNewton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit FunctionAn unconstrained smooth minimization reformulation of the second-order cone complementarity problemSufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem




Cites Work




This page was built for publication: New NCP-functions and their properties