The following pages link to LIPSOL (Q16880):
Displaying 50 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)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- D-optimality of non-regular design spaces by using a Bayesian modification and a hybrid method (Q381500) (← links)
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- A preconditioning technique for Schur complement systems arising in stochastic optimization (Q453622) (← links)
- Design of optimal PID controller with \(\epsilon\)-Routh stability for different processes (Q474386) (← links)
- New barrier parameter updating technique in Mehrotra-type algorithm (Q553428) (← links)
- Solving nonlinear programming problems with noisy function values and noisy gradients (Q700766) (← links)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
- A self-adjusting interior point algorithm for linear complementarity problems (Q814067) (← links)
- Implementing an interior point method for linear programs on a CPU-GPU system (Q836722) (← links)
- Interior point method for long-term generation scheduling of large-scale hydrothermal systems (Q839779) (← links)
- Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
- Nonlinear rescaling as interior quadratic prox method in convex optimization (Q861517) (← 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)
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
- On a primal-dual analytic center cutting plane method for variational inequalities (Q1294811) (← links)
- Improved smoothing-type methods for the solution of linear programs (Q1348921) (← links)
- Parallel interior-point method for linear and quadratic programs with special structure (Q1608140) (← links)
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
- A homogeneous model for monotone mixed horizontal linear complementarity problems (Q1734775) (← links)
- Stabilization of Mehrotra's primal-dual algorithm and its implementation (Q1771347) (← links)
- Augmented sparse reconstruction of protein signaling networks (Q1798095) (← links)
- The integration of an interior-point cutting plane method within a branch-and-price algorithm (Q1881560) (← 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)
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← 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)
- Robust preliminary analysis of large-scale linear model for optimal industrial investments (Q2271503) (← 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)
- A variance-expected compliance model for structural optimization (Q2429414) (← links)
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update (Q2490335) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← 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)
