scientific article; zbMATH DE number 1059228
From MaRDI portal
Publication:4353542
zbMATH Open0886.90158MaRDI QIDQ4353542FDOQ4353542
Authors: Zhi-Quan Luo, Paul Tseng 
Publication date: 10 September 1997
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1569004
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Merit functions for nonsmooth complementarity problems and related descent algorithms
- A descent Newton method for solving nonlinear complementarity problem with \(P_0\)-function
- New NCP-functions and their properties
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (39)
- On construction of new NCP functions
- Properties of a family of merit functions and a merit function method for the NCP
- Stationary points of bound constrained minimization reformulations of complementarity problems
- Title not available (Why is that?)
- An affine scaling interior trust-region method for \(LC^{1}\) minimization subject to bounds on variables
- Merit functions: a bridge between optimization and equilibria
- Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function
- The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems
- Inverse coefficient problems for variational inequalities: Optimality conditions and numerical realization
- Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems.
- Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem
- Derivative-free methods for monotone variational inequality and complementarity problems
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Error bounds in mathematical programming
- New NCP-functions and their properties
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems
- SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
- A new filter method for solving nonlinear complementarity problems
- Robust solution of monotone stochastic linear complementarity problems
- Merit functions for nonsmooth complementarity problems and related descent algorithms
- A descent Newton method for solving nonlinear complementarity problem with \(P_0\)-function
- On the natural merit function for solving complementarity problems
- Strict feasibility conditions in nonlinear complementarity problems
- An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems
- A filter method for solving nonlinear complementarity problems based on derivative-free line search
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Properties of restricted NCP functions for nonlinear complementarity problems
- Title not available (Why is that?)
- Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Two Classes of Merit Functions for Infinite-Dimensional Second Order Complimentary Problems
- A smooth dual gap function solution to a class of quasivariational inequalities
- Two classes of merit functions for the second-order cone complementarity problem
- A one-parametric class of merit functions for the second-order cone complementarity problem
- Properties and construction of NCP functions
- The linear convergence of a derivative-free descent method for nonlinear complementarity problems
- On almost smooth functions and piecewise smooth functions
- A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353542)
