Pages that link to "Item:Q1876589"
From MaRDI portal
The following pages link to Preconditioning indefinite systems in interior point methods for optimization (Q1876589):
Displaying 50 items.
- Low-rank update of preconditioners for the inexact Newton method with SPD Jacobian (Q409817) (← links)
- Matrix-free interior point method (Q429480) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- A preconditioning technique for Schur complement systems arising in stochastic optimization (Q453622) (← links)
- Sparsity preserving preconditioners for linear systems in interior-point methods (Q493682) (← links)
- FSAI-based parallel mixed constraint preconditioners for saddle point problems arising in geomechanics (Q645721) (← links)
- Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods (Q665950) (← links)
- RMCP: relaxed mixed constraint preconditioners for saddle point linear systems arising in geomechanics (Q695850) (← links)
- New block triangular preconditioner for linear systems arising from the discretized time-harmonic Maxwell equations (Q711840) (← links)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- On block-diagonally preconditioned accelerated parameterized inexact Uzawa method for singular saddle point problems (Q905266) (← links)
- Mixed constraint preconditioners for the iterative solution of FE coupled consolidation equations (Q956343) (← links)
- An inexact primal-dual path following algorithm for convex quadratic SDP (Q995786) (← links)
- Novel preconditioners for the iterative solution to FE-discretized coupled consolidation equations (Q1033215) (← links)
- Improving the preconditioning of linear systems from interior point methods (Q1652361) (← links)
- Stability and accuracy of inexact interior point methods for convex quadratic programming (Q1686666) (← links)
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives (Q1954336) (← links)
- The generalized double shift-splitting preconditioner for nonsymmetric generalized saddle point problems from the steady Navier-Stokes equations (Q1993612) (← links)
- A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (Q2012233) (← links)
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
- Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines (Q2053310) (← links)
- Block preconditioners for linear systems in interior point methods for convex constrained optimization (Q2084581) (← links)
- A reverse augmented constraint preconditioner for Lagrange multiplier methods in contact mechanics (Q2138667) (← links)
- Improved penalty algorithm for mixed integer PDE constrained optimization problems (Q2147266) (← links)
- A scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors (Q2254755) (← links)
- A matrix-free smoothing algorithm for large-scale support vector machines (Q2279568) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- Interior-point solver for large-scale quadratic programming problems with bound constraints (Q2370027) (← links)
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods (Q2379689) (← links)
- On the update of constraint preconditioners for regularized KKT systems (Q2397820) (← links)
- A comparison of reduced and unreduced KKT systems arising from interior point methods (Q2401021) (← links)
- Condition numbers of generalized saddle point systems (Q2424226) (← links)
- Some iterative methods for the solution of a symmetric indefinite KKT system (Q2457945) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- A primal-dual interior-point algorithm for quadratic programming (Q2502230) (← links)
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming (Q2636608) (← links)
- Mixed constraint preconditioning in computational contact mechanics (Q2637890) (← links)
- Inner solvers for interior point methods for large scale nonlinear programming (Q2642630) (← links)
- An interior-point approach for primal block-angular problems (Q2643610) (← links)
- Inexact constraint preconditioners for linear systems arising in interior point methods (Q2643611) (← links)
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization (Q2643614) (← links)
- Using constraint preconditioners with regularized saddle-point problems (Q2643616) (← links)
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming (Q2643618) (← links)
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study (Q2643619) (← links)
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
- Interior-point solver for convex separable block-angular problems (Q2811483) (← links)
- Null-Space Preconditioners for Saddle Point Systems (Q2818269) (← links)
- An interior-point algorithm for the minimization arising from 3D contact problems with friction (Q2867430) (← links)
