The following pages link to LIPSOL (Q16880):
Displaying 36 items.
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming (Q2643618) (← links)
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils (Q2666658) (← links)
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
- A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems (Q2706340) (← links)
- Robust reduction of a class of large-scale linear programs (Q2784411) (← links)
- Approximating high-dimensional dynamics by barycentric coordinates with linear programming (Q2821598) (← links)
- A computational study of the use of an optimization-based method for simulating large multibody systems† (Q2887098) (← links)
- Scenario formulation of stochastic linear programs and the homogeneous self-dual interior-point method (Q2892301) (← links)
- MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems (Q3103543) (← links)
- Shape optimization of piezoelectric sensors or actuators for the control of plates (Q3365421) (← links)
- An efficient linear programming solver for optimal filter synthesis (Q3392865) (← links)
- Polynomial chaos representation of a stochastic preconditioner (Q3425288) (← links)
- Strict quasi-concavity and the differential barrier property of gauges in linear programming (Q3453425) (← links)
- A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods (Q3525951) (← links)
- On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization (Q3544263) (← links)
- On Mehrotra-Type Predictor-Corrector Algorithms (Q3544266) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- (Q3589499) (← links)
- A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION (Q3636502) (← links)
- Solving large-scale linear programs by interior-point methods under the Matlab<sup>∗</sup>Environment<sup>†</sup> (Q4227923) (← links)
- A nonlinear approach to a class of combinatorial optimization problems (Q4259026) (← links)
- Complete Orthogonal Decomposition for Weighted Least Squares (Q4337387) (← links)
- A dynamic large-update primal‐dual interior-point method for linear optimization (Q4405939) (← links)
- Blind Deconvolution Using a Regularized Structured Total Least Norm Algorithm (Q4443787) (← links)
- User'S guide To Lipsol linear-programming interior point solvers V0.4 (Q4504786) (← links)
- PCx: an interior-point code for linear programming (Q4504787) (← links)
- Benchmarking interior point Lp/Qp solvers (Q4504797) (← links)
- On the Identification of Zero Variables in an Interior-Point Framework (Q4509751) (← links)
- A self-adjusting primal–dual interior point method for linear programs (Q4657821) (← links)
- Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming (Q4702328) (← links)
- (Q4791754) (← links)
- Fast Core Pricing for Rich Advertising Auctions (Q5031009) (← links)
- A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP (Q5039376) (← links)
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy (Q5057773) (← links)
- An adaptive self-regular proximity-based large-update IPM for LO (Q5312761) (← links)
- On the solution of linear programs by Jacobian smoothing methods (Q5959288) (← links)
