The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems
From MaRDI portal
Publication:702592
DOI10.1016/j.amc.2003.10.040zbMath1068.65083OpenAlexW2028124301MaRDI QIDQ702592
Publication date: 17 January 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2003.10.040
global convergencevariational inequalityTrust region methodsemidefinite complementarity problembounded smooth reformulationTruncated conjugated gradient method
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, A modified Levenberg-Marquardt method for nonsmooth equations with finitely many maximum functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Merit functions for semi-definite complementarity problems
- Nonlinear complementarity as unconstrained and constrained minimization
- New NCP-functions and their properties
- Non-interior continuation methods for solving semidefinite complementarity problems
- On the truncated conjugate gradient method
- A primal-dual potential reduction method for problems involving matrix inequalities
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- A Trust Region Method for Solving Generalized Complementarity Problems
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
- Reformulation of Variational Inequalities on a Simplex and Compactification of Complementarity Problems
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- A new strategy for solving variational inequalities in bounded polytopes∗
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
