New constrained optimization reformulation of complementarity problems
From MaRDI portal
Recommendations
- A note on unconstrained reformulation of complementarity problem.
- Stationary points of bound constrained minimization reformulations of complementarity problems
- Box-constrained minimization reformulations of complementarity problems in second-order cones
- Unconstrained minimization approaches to nonlinear complementarity problems
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 1329058 (Why is no real title available?)
- scientific article; zbMATH DE number 1329059 (Why is no real title available?)
- scientific article; zbMATH DE number 1076336 (Why is no real title available?)
- scientific article; zbMATH DE number 1552025 (Why is no real title available?)
- A Class of penalty functions for optimization problema with bound constraints
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- A Newton-type method for positive-semidefinite linear complementarity problems
- A Positive Algorithm for the Nonlinear Complementarity Problem
- A new trust region algorithm for bound constrained minimization
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A special newton-type optimization method
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
- Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Gauss-Newton methods for the complementarity problem
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Global Methods for Nonlinear Complementarity Problems
- Local uniqueness and convergence of iterative methods for nonsmooth variational inequalities
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- New NCP-functions and their properties
- Nonlinear complementarity as unconstrained and constrained minimization
- Nonlinear complementarity as unconstrained optimization
- OPTIMIZATION BASED GLOBALLY CONVERGENT METHODS FOR THE NONLINEAR COMPLEMENTARITY PROBLEM
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- On the resolution of monotone complementarity problems
- Optimization and nonsmooth analysis
- Solution of linear complementarity problems using minimization with simple bounds
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Unconstrained minimization approaches to nonlinear complementarity problems
Cited in
(16)- An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- Box-constrained minimization reformulations of complementarity problems in second-order cones
- Nonnegative iterative reweighted method for sparse linear complementarity problem
- A note on unconstrained reformulation of complementarity problem.
- scientific article; zbMATH DE number 2208703 (Why is no real title available?)
- On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability
- A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
- Solving binary-constrained mixed complementarity problems using continuous reformulations
- Reference variable methods of solving min-Max optimization problems
- Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound
- An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems
- Convergence analysis of a trust-region multidimensional filter method for nonlinear complementarity problems
- A complementarity constraint formulation of convex multiobjective optimization problems
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- Recurrent neural network model based on projective operator and its application to optimization problems
This page was built for publication: New constrained optimization reformulation of complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264991)
