Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms
From MaRDI portal
Publication:597176
DOI10.1023/B:JOTA.0000005450.58251.6dzbMath1055.90057OpenAlexW2010164741MaRDI QIDQ597176
Kim-Chuan Toh, Guanglu Zhou, Defeng Sun
Publication date: 6 August 2004
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jota.0000005450.58251.6d
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
An algorithm for a class of nonlinear complementarity problems with non-Lipschitzian functions ⋮ Smoothing Newton method for minimizing the sum of \(p\) -norms
Cites Work
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A regularization Newton method for solving nonlinear complementarity problems
- A class of smoothing functions for nonlinear and mixed complementarity problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A quadratically convergent method for minimizing a sum of euclidean norms
- A projected newton method forl p norm location problems
- Normal Maps Induced by Linear Transformations
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
