Component-wise verified solutions for constrained convex programming

DOI10.14495/JSIAML.17.73MaRDI QIDQ6898597zbMATH OpenFDO

Authors Mao Kawasaki, Ryo Kobayashi, Takuma Kimura, Shin'ichi Oishi

Publication date 17 November 2025

Published in JSIAM Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14495/JSIAML.17.73

zbMATH Keywords

complementarity problemcontinuous Newton methodconvex programmingKantorovich's theoremnumerical verification

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of quasi-Newton type (90C53)

Cites work

• Continuous Newton-Raphson method for solving and underdetermined system of nonlinear equations
• Error bounds for approximate solutions of systems of equations
• scientific article; zbMATH DE number 3933857 (Why is no real title available?)
• scientific article; zbMATH DE number 1440908 (Why is no real title available?)
• Interior Point Methods for Nonlinear Optimization
• Numerical inclusion of optimum point for linear programming
• Numerical solution of saddle point problems
• Random test problems and parallel methods for quadratic programs and quadratic stochastic programs^∗
• Validated solutions for P-matrix linear complementarity problems

This page was built for publication: Component-wise verified solutions for constrained convex programming

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