Pages that link to "Item:Q1356058"

The following pages link to Solution of monotone complementarity problems with locally Lipschitzian functions (Q1356058):

Displaying 50 items.

• Geometric views of the generalized fischer-burmeister function and its induced merit function (Q274937) (← links)
• An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function (Q279269) (← links)
• \(hp\)-adaptive IPDG/TDG-FEM for parabolic obstacle problems (Q316546) (← links)
• Nonsingularity conditions for FB system of reformulating nonlinear second-order cone programming (Q370062) (← links)
• A gradient-based approach for discrete optimum design (Q381494) (← links)
• Smooth and nonsmooth analyses of vector-valued functions associated with circular cones (Q387138) (← links)
• An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions (Q403631) (← links)
• Calibration of estimator-weights via semismooth Newton method (Q427370) (← links)
• A proximal point algorithm for the monotone second-order cone complementarity problem (Q429513) (← links)
• The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function (Q434689) (← links)
• A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
• A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations (Q530014) (← links)
• A globally convergent semi-smooth Newton method for control-state constrained DAE optimal control problems (Q538312) (← links)
• Feasible smooth method based on Barzilai-Borwein method for stochastic linear complementarity problem (Q542438) (← links)
• A kind of nonmonotone filter method for nonlinear complementarity problem (Q545563) (← links)
• An efficient algorithm for solving supply chain network equilibria and equivalent supernetwork based traffic network equilibria (Q546459) (← links)
• The penalized Fischer-Burmeister SOC complementarity function (Q548683) (← links)
• A new hybrid method for nonlinear complementarity problems (Q548690) (← links)
• Solving equations via the trust region and its application to a class of stochastic linear complementarity problems (Q552359) (← links)
• New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems (Q555370) (← links)
• A new smoothing Newton method for solving constrained nonlinear equations (Q555395) (← links)
• Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms (Q597176) (← links)
• Convergence of a continuous approach for zero-one programming problems (Q621018) (← links)
• Merit functions for nonsmooth complementarity problems and related descent algorithms (Q622484) (← links)
• A non-interior continuation algorithm for the CP based on a generalized smoothing function (Q629488) (← links)
• A smoothing method for zero--one constrained extremum problems (Q637567) (← links)
• Generalized Newton-iterative method for semismooth equations (Q645032) (← links)
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
• A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function (Q652335) (← links)
• A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function (Q652695) (← links)
• A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities (Q657283) (← links)
• Nonnegative inverse eigenvalue problems with partial eigendata (Q664539) (← links)
• An operator splitting method for monotone variational inequalities with a new perturbation strategy (Q683929) (← links)
• A new smoothing and regularization Newton method for \(P_{0}\)-NCP (Q708899) (← links)
• An inexact SQP Newton method for convex SC\(^{1}\) minimization problems (Q711698) (← links)
• Properties of a family of merit functions and a merit function method for the NCP (Q716527) (← links)
• A new logarithmic-quadratic proximal method for nonlinear complementarity problems (Q732410) (← links)
• Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems (Q732492) (← links)
• Convergence analysis of a trust-region multidimensional filter method for nonlinear complementarity problems (Q779502) (← links)
• An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
• An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function (Q781395) (← links)
• A damped Gauss-Newton method for the second-order cone complementarity problem (Q836060) (← links)
• A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities (Q847182) (← links)
• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
• On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints (Q853889) (← links)
• The charges on the paths (Q856107) (← links)
• Two classes of merit functions for the second-order cone complementarity problem (Q857837) (← links)
• The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem (Q858580) (← links)
• A new filter method for solving nonlinear complementarity problems (Q870225) (← links)
• On almost smooth functions and piecewise smooth functions (Q881610) (← links)