The following pages link to On NCP-functions (Q1294826):
Displayed 50 items.
- Geometric views of the generalized fischer-burmeister function and its induced merit function (Q274937) (← links)
- A semismooth Newton method for tensor eigenvalue complementarity problem (Q316172) (← links)
- Convergence analysis of Euler discretization of control-state constrained optimal control problems with controls of bounded variation (Q380566) (← links)
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations (Q530424) (← links)
- Stochastic mathematical programs with hybrid equilibrium constraints (Q544222) (← links)
- Convergence of an inexact generalized Newton method with a scaled residual control (Q552356) (← links)
- Feasible method for generalized semi-infinite programming (Q604267) (← links)
- A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
- Merit functions for nonsmooth complementarity problems and related descent algorithms (Q622484) (← links)
- New second-order cone linear complementarity formulation and semi-smooth Newton algorithm for finite element analysis of 3D frictional contact problem (Q643932) (← links)
- A new class of penalized NCP-functions and its properties (Q645547) (← links)
- A new C-function for symmetric cone complementarity problems (Q652660) (← links)
- Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations. (Q664403) (← links)
- Properties and construction of NCP functions (Q694526) (← links)
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems (Q782310) (← links)
- A double nonmonotone quasi-Newton method for nonlinear complementarity problem based on piecewise NCP functions (Q826387) (← links)
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function (Q843152) (← links)
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem (Q858580) (← links)
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs (Q939548) (← links)
- Robust solution of monotone stochastic linear complementarity problems (Q959962) (← links)
- Superlinearly convergent affine scaling interior trust-region method for linear constrained \(LC^{1}\) minimization (Q960640) (← links)
- Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem (Q972943) (← links)
- A family of NCP functions and a descent method for the nonlinear complementarity problem (Q1001190) (← links)
- Feasible semismooth Newton method for a class of stochastic linear complementarity problems (Q1014020) (← links)
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems (Q1026431) (← links)
- Discovery of new complementarity functions for NCP and SOCCP (Q1715644) (← links)
- Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
- Symmetrization of generalized natural residual function for NCP (Q1785378) (← links)
- A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem (Q1946971) (← links)
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems (Q1986109) (← links)
- Tensor absolute value equations (Q1989899) (← links)
- A smoothing Newton method for symmetric cone complementarity problems (Q2017827) (← links)
- Gauss-Newton-type methods for bilevel optimization (Q2028474) (← links)
- Weakening convergence conditions of a potential reduction method for tensor complementarity problems (Q2086932) (← links)
- Semismooth and smoothing Newton methods for nonlinear systems with complementarity constraints: adaptivity and inexact resolution (Q2087487) (← links)
- Real-time pricing method for smart grid based on social welfare maximization model (Q2097501) (← links)
- On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming (Q2173976) (← links)
- On smooth relaxations of obstacle sets (Q2254177) (← links)
- On generalized convexity of nonlinear complementarity functions (Q2260699) (← links)
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions (Q2268920) (← links)
- Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem (Q2273060) (← links)
- Tensor complementarity problems. II: Solution methods (Q2275317) (← links)
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction (Q2350869) (← links)
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems (Q2390009) (← links)
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming (Q2392971) (← links)
- Approximations and generalized Newton methods (Q2413105) (← links)
- New smooth C-functions for symmetric cone complementarity problems (Q2468780) (← links)
- An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables (Q2489419) (← links)
- A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems (Q2497398) (← links)