The following pages link to Symmetric Quasidefinite Matrices (Q4764310):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
- CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
- Regularization techniques in interior point methods (Q432801) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- Perturbation analysis for block downdating of the generalized Cholesky factorization (Q440899) (← links)
- Backward stability analysis of weighted linear least-squares problems (Q467427) (← links)
- Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
- Block splitting for distributed optimization (Q744220) (← links)
- Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization (Q745223) (← links)
- Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- Modifying the inertia of matrices arising in optimization (Q1307208) (← links)
- An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
- Investigations in topology. 9. Work collection (Q1575790) (← links)
- Conditionally definite matrices (Q1576008) (← links)
- Bitopologies on products and ratios (Q1576016) (← links)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- An interior point method for nonlinear optimization with a quasi-tangential subproblem (Q1689438) (← links)
- A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Inertia-controlling factorizations for optimization algorithms (Q1862009) (← links)
- Solution of sparse rectangular systems using LSQR and Craig (Q1907877) (← links)
- Perturbation theory for the eigenvalues of factorised symmetric matrices (Q1976911) (← links)
- Rounding-error and perturbation bounds for the indefinite QR factorization (Q1976912) (← links)
- Algebra -- 9. Translated from the Russian (Q1977412) (← links)
- An interior point-proximal method of multipliers for convex quadratic programming (Q2028483) (← links)
- Optimal representative sample weighting (Q2058720) (← links)
- Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications (Q2080828) (← links)
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs (Q2088967) (← links)
- On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
- On the strong \(P\)-regular splitting iterative methods for non-Hermitian linear systems (Q2142786) (← links)
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming (Q2173976) (← links)
- A regularization method for constrained nonlinear least squares (Q2191800) (← links)
- An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
- A note on the perturbation analysis for the generalized Cholesky factorization (Q2266982) (← links)
- Exploiting structure in parallel implementation of interior point methods for optimization (Q2271797) (← links)
- Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices (Q2332393) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods (Q2379689) (← links)
- Application of lower bound direct method to engineering structures (Q2385504) (← links)
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming (Q2420822) (← 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 sparse proximal implementation of the LP dual active set algorithm (Q2465650) (← links)
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems (Q2480251) (← links)
- 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization (Q2481366) (← links)
