A two-steps fixed-point method for the simplicial cone constrained convex quadratic optimization

DOI10.24193/SUBBMATH.2024.2.13MaRDI QIDQ6963613zbMATH OpenFDO

Authors Merzaka Khaldi, Mohamed Achache

Publication date 7 July 2025

Published in Studia Universitatis Babeș-Bolyai. Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.24193/SUBBMATH.2024.2.13

zbMATH Keywords

absolute value equationslinear complementarity problemPicard's fixed point iterative methodquadratic programmingsimplicial cones

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites work

• A generalized Newton method for absolute value equations
• A generalized Newton method for absolute value equations associated with second order cones
• A modified generalized Newton method for absolute value equations
• A quasi-Newton method for non-smooth equations
• A theorem of the alternatives for the equationAx+B|x| =b
• Absolute value equations
• An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side
• Bessel process, Schramm-Loewner evolution, and the Dyson model
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 465666 (Why is no real title available?)
• scientific article; zbMATH DE number 7260006 (Why is no real title available?)
• Linear complementarity as absolute value equation solution
• On an iterative method for solving absolute value equations
• On unique solvability and Picard’s iterative method for absolute value equations
• On YJ-injectivity and annihilators.
• Projection onto simplicial cones by a semi-smooth Newton method
• Projection onto simplicial cones by Picard's method
• Solving absolute value equation using complementarity and smoothing functions
• The new iteration algorithm for absolute value equation

This page was built for publication: A two-steps fixed-point method for the simplicial cone constrained convex quadratic optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963613)