Discovery of new complementarity functions for NCP and SOCCP
From MaRDI portal
Publication:1715644
DOI10.1007/s40314-018-0660-0zbMath1438.90358OpenAlexW2807303275MaRDI QIDQ1715644
Peng-Fei Ma, Jein-Shan Chen, Chun-Hsu Ko, Chien-Hao Huang
Publication date: 29 January 2019
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-018-0660-0
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Penalized NCP-functions for nonlinear complementarity problems and a scaling algorithm, Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions, Some results on the filter method for nonlinear complementary problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric views of the generalized fischer-burmeister function and its induced merit function
- A new class of penalized NCP-functions and its properties
- Properties and construction of NCP functions
- Analysis of nonsmooth vector-valued functions associated with second-order cones.
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- Two classes of merit functions for the second-order cone complementarity problem
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
- Numerical comparisons of two effective methods for mixed complementarity problems
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- On NCP-functions
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Symmetrization of generalized natural residual function for NCP
- On the resolution of monotone complementarity problems
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- Nonlinear complementarity as unconstrained optimization
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
- Unconstrained minimization approaches to nonlinear complementarity problems
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- A linearly convergent derivative-free descent method for the second-order cone complementarity problem
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Newton's Method for B-Differentiable Equations
- Three-dimensional quasi-static frictional contact by using second-order cone linear complementarity problem
- Iterative methods for variational and complementarity problems
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- A special newton-type optimization method
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
- On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem
- Benchmarking optimization software with performance profiles.
