A class of smoothing functions for nonlinear and mixed complementarity problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5846040
- Smooth Approximations to Nonlinear Complementarity Problems
- A smoothing Newton method for NCP based on a new class of smoothing functions
- A new class of smoothing functions and a smoothing Newton method for complementarity problems
- Smoothing methods for nonlinear complementarity problems
Cites work
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 4088853 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3393631 (Why is no real title available?)
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A polynomial-time algorithm for a class of linear complementarity problems
- A smoothing-out technique for min—max optimization
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Generalized equations and their solutions, Part I: Basic theory
- Global Convergence of Damped Newton's Method for Nonsmooth Equations via the Path Search
- Global Methods for Nonlinear Complementarity Problems
- Mathematical Programming in Neural Networks
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- Newton's Method for B-Differentiable Equations
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Nondifferentiable optimization via smooth approximation: General analytical approach
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Smoothing methods for convex inequalities and linear complementarity problems
- Strongly Regular Generalized Equations
- The Extended Linear Complementarity Problem
- The Generalized Order Linear Complementarity Problem
- The relation between the path of centers and Smale's regularization of the linear programming problem
Cited in
(only showing first 100 items - show all)- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
- Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
- A continuation method for rigid-cohesive fracture in a discontinuous Galerkin finite element setting
- A pathsearch damped Newton method for computing general equilibria
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations
- On the regularization method in nondifferentiable optimization applied to hemivariational inequalities
- A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets
- Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
- A constitutive-based element-by-element crack propagation algorithm with local mesh refinement
- Empirical risk minimization in the non-interactive local model of differential privacy
- Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity.
- On the convergence of a smooth penalty algorithm without computing global solutions
- On the global minimization of the value-at-risk
- Complexity of a noninterior path-following method for the linear complementarity problem
- A homotopy method for bioluminescence tomography
- An approximate lower order penalty approach for solving second-order cone linear complementarity problems
- Some non-interior path-following methods based on a scaled central path for linear complementarity problems
- An accelerated relaxed-inertial strategy based CGP algorithm with restart technique for constrained nonlinear pseudo-monotone equations to image de-blurring problems
- A Jacobian smoothing inexact Newton method for solving the nonlinear complementary problem
- A new active-set strategy for NCP with degenerate solutions
- Numerical solution of a class of moving boundary problems with a nonlinear complementarity approach
- An interior penalty approach to a large-scale discretized obstacle problem with nonlinear constraints
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- Continuation method for nonlinear complementarity problems via normal maps
- An alternative formulation for quasi-static frictional and cohesive contact problems
- A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics
- Homotopy method for solving variational inequalities with bounded box constraints
- On a new smoothing technique for non-smooth, non-convex optimization
- A power penalty approach to a discretized obstacle problem with nonlinear constraints
- Unified smoothing functions for absolute value equation associated with second-order cone
- A damped semismooth Newton iterative method for solving mixed linear complementarity problems
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
- Uniform bounds on the 1-norm of the inverse of lower triangular Toeplitz matrices
- The Hertz contact problem, coupled Volterra integral equations and a linear complementarity problem
- Neural network based on systematically generated smoothing functions for absolute value equation
- Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.
- A new smoothing Broyden-like method for solving the mixed complementarity problem with a \(P_{0}\)-function
- A smoothing homotopy method for solving variational inequalities
- Comparison of MINLP formulations for global superstructure optimization
- A primal-dual algorithm for minimizing a sum of Euclidean norms
- A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
- The subdifferential of measurable composite max integrands and smoothing approximation
- A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Constrained Consensus-Based Optimization
- Barzilai–Borwein method with variable sample size for stochastic linear complementarity problems
- A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration
- MPCC strategies for nonsmooth nonlinear programs
- Gradient consistency for integral-convolution smoothing functions
- An approximation scheme for a class of risk-averse stochastic equilibrium problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms
- Smoothing and regularization strategies for optimization of hybrid dynamic systems
- Perturbed augmented Lagrangian method framework with applications to proximal and smoothed variants
- Neural network approaches based on new NCP-functions for solving tensor complementarity problem
- The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
- The convergence of a smoothing damped Gauss-Newton method for nonlinear complementarity problem
- Penalty and barrier methods for convex semidefinite programming
- A fixed-point method for a class of super-large scale nonlinear complementarity problems
- A new smoothing approach to exact penalty functions for inequality constrained optimization problems
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming
- A smoothing approximation-based adaptive neurodynamic approach for nonsmooth resource allocation problem
- A full-Newton step non-interior continuation algorithm for a class of complementarity problems
- Element-wise algorithm for modeling ductile fracture with the Rousselier yield function
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- Computing Wardropian equilibria in a complementarity framework
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem
- A smoothing heuristic for a bilevel pricing problem
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
- A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques
- Smoothing quadratic regularization method for hemivariational inequalities
- A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem
- A modified Broyden-like method for nonlinear complementarity problems
- A globally convergent Levenberg-Marquardt method for the least \(l_2\)-norm solution of nonlinear inequalities
- Formulation and comparison of algorithms for frictional contact problems
- Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
- One-step quadratic convergence of noninterior continuation method for NCP
- A smoothing least squares method for nonlinear complementarity problem
- scientific article; zbMATH DE number 5846040 (Why is no real title available?)
- Computational methods for elastoplasticity: an overview of conventional and \textit{less-conventional} approaches
- Solving variational inequality problems via smoothing-nonsmooth reformulations
- Model building and optimization analysis of MDF continuous hot-pressing process by neural network
- A class of smoothing SAA methods for a stochastic mathematical program with complementarity constraints
- A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations
- Smoothly approximated support vector domain description
- Examples of ill-behaved central paths in convex optimization
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
- Extension of smoothing functions to symmetric cone complementarity problems
- The quadratic convergence of a smoothing Levenberg-Marquardt method for nonlinear complementarity problem
- On smoothing exact penalty functions for nonlinear constrained optimization problems
- Homotopy method for solving ball-constrained variational inequalities
- Computation of generalized differentials in nonlinear complementarity problems
- Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound
- On piecewise quadratic Newton and trust region problems
This page was built for publication: A class of smoothing functions for nonlinear and mixed complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815073)
