Pages that link to "Item:Q4227923"
From MaRDI portal
The following pages link to Solving large-scale linear programs by interior-point methods under the Matlab<sup>∗</sup>Environment<sup>†</sup> (Q4227923):
Displaying 41 items.
- Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
- Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
- Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← links)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
- Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← links)
- Warm start by Hopfield neural networks for interior point methods (Q875399) (← links)
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
- Efficient GPU-based implementations of simplex type algorithms (Q902763) (← links)
- Fast Cholesky factorization for interior point methods of linear programming (Q1361270) (← links)
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
- Stabilization of Mehrotra's primal-dual algorithm and its implementation (Q1771347) (← links)
- Augmented sparse reconstruction of protein signaling networks (Q1798095) (← links)
- The convergence of an interior-point method using modified search directions in final iterations (Q1886472) (← links)
- Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems (Q1948525) (← links)
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems (Q2067705) (← links)
- The effect of nanoparticle conglomeration on the overall conductivity of nanocomposites (Q2213003) (← links)
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming (Q2273110) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners (Q2356092) (← links)
- A finite termination Mehrotra-type predictor-corrector algorithm (Q2383922) (← links)
- Topology optimization design of 3D electrothermomechanical actuators by using GPU as a co-processor (Q2417560) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- A predictor-corrector algorithm for linear optimization based on a modified Newton direction (Q2511088) (← links)
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (Q2642898) (← links)
- An interior-point approach for primal block-angular problems (Q2643610) (← links)
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils (Q2666658) (← links)
- Symbolic implementation of interior point method for linear programming problem (Q3056355) (← links)
- A SELF-REGULAR NEWTON BASED ALGORITHM FOR LINEAR OPTIMIZATION (Q3057474) (← links)
- Shape optimization of piezoelectric sensors or actuators for the control of plates (Q3365421) (← links)
- Mehrotra-type predictor-corrector algorithm revisited (Q3539794) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION (Q3636502) (← links)
- User'S guide To Lipsol linear-programming interior point solvers V0.4 (Q4504786) (← links)
- Benchmarking interior point Lp/Qp solvers (Q4504797) (← 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)
- Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data (Q5090518) (← links)
- A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan (Q6092619) (← links)