An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
From MaRDI portal
Publication:5232118
Cites work
- scientific article; zbMATH DE number 6610411 (Why is no real title available?)
- scientific article; zbMATH DE number 5162350 (Why is no real title available?)
- scientific article; zbMATH DE number 4002273 (Why is no real title available?)
- scientific article; zbMATH DE number 2201293 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- A Partition Theorem for Euclidean n-Space
- A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- A feasible active set method for strictly convex quadratic problems with simple bounds
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
- A nonsmooth version of Newton's method
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- An algorithmic characterization of \(\mathbf P\)-matricity
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Engineering and Economic Applications of Complementarity Problems
- Gas phase appearance and disappearance as a problem with complementarity constraints
- Inexact semismooth Newton methods for large-scale complementarity problems
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Numerical optimization. Theoretical and practice aspects
- On finite termination of an iterative method for linear complementarity problems
- Primal-Dual Strategy for Constrained Optimal Control Problems
- The Linear Complementarity Problem
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
Cited in
(5)- A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems
- Exact computation of an error bound for the balanced linear complementarity problem with unique solution
- A posteriori error estimates for a compositional two-phase flow with nonlinear complementarity constraints
- Semismooth and smoothing Newton methods for nonlinear systems with complementarity constraints: adaptivity and inexact resolution
- A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
This page was built for publication: An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232118)
