LIPSOL

swMATH4712MaRDI QIDQ16880

No author found.

Related Items (86)

A computational study of the use of an optimization-based method for simulating large multibody systems† ⋮ A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP ⋮ A nonlinear approach to a class of combinatorial optimization problems ⋮ The integration of an interior-point cutting plane method within a branch-and-price algorithm ⋮ Scenario Formulation of Stochastic Linear Programs and the Homogeneous Self-Dual Interior-Point Method ⋮ The convergence of an interior-point method using modified search directions in final iterations ⋮ Implementing an interior point method for linear programs on a CPU-GPU system ⋮ Interior point method for long-term generation scheduling of large-scale hydrothermal systems ⋮ Infeasible interior-point methods for linear optimization based on large neighborhood ⋮ Strict quasi-concavity and the differential barrier property of gauges in linear programming ⋮ Improved smoothing-type methods for the solution of linear programs ⋮ Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ A finite termination Mehrotra-type predictor-corrector algorithm ⋮ Primal-dual nonlinear rescaling method for convex optimization ⋮ Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking ⋮ An interior-point approach for primal block-angular problems ⋮ Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming ⋮ An adaptive self-regular proximity-based large-update IPM for LO ⋮ Nonlinear rescaling as interior quadratic prox method in convex optimization ⋮ Polynomial time second order mehrotra-type predictor--corrector algorithms ⋮ Unnamed Item ⋮ Warm start by Hopfield neural networks for interior point methods ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils ⋮ D-optimality of non-regular design spaces by using a Bayesian modification and a hybrid method ⋮ Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms ⋮ A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming ⋮ An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints ⋮ Topology optimization design of 3D electrothermomechanical actuators by using GPU as a co-processor ⋮ PAL-Hom method for QP and an application to LP ⋮ A polynomial arc-search interior-point algorithm for convex quadratic programming ⋮ Efficient GPU-based implementations of simplex type algorithms ⋮ A variance-expected compliance model for structural optimization ⋮ Hopfield neural networks in large-scale linear optimization problems ⋮ Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems ⋮ Adaptive constraint reduction for convex quadratic programming ⋮ Complete Orthogonal Decomposition for Weighted Least Squares ⋮ A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods ⋮ The effect of nanoparticle conglomeration on the overall conductivity of nanocomposites ⋮ A preconditioning technique for Schur complement systems arising in stochastic optimization ⋮ A Comparison of a Moreau--Yosida-Based Active Set Strategy and Interior Point Methods for Constrained Optimal Control Problems ⋮ Design of optimal PID controller with \(\epsilon\)-Routh stability for different processes ⋮ On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization ⋮ On Mehrotra-Type Predictor-Corrector Algorithms ⋮ A homogeneous model for monotone mixed horizontal linear complementarity problems ⋮ Unnamed Item ⋮ Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming ⋮ Interior Point Methods for Nonlinear Optimization ⋮ A self-adjusting primal–dual interior point method for linear programs ⋮ Solving nonlinear programming problems with noisy function values and noisy gradients ⋮ Primal-dual nonlinear rescaling method with dynamic scaling parameter update ⋮ New barrier parameter updating technique in Mehrotra-type algorithm ⋮ Stabilization of Mehrotra's primal-dual algorithm and its implementation ⋮ A dynamic large-update primal‐dual interior-point method for linear optimization ⋮ Robust preliminary analysis of large-scale linear model for optimal industrial investments ⋮ Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization ⋮ Robust Reduction of a Class of Large-Scale Linear Programs ⋮ A semidefinite programming based polyhedral cut and price approach for the maxcut problem ⋮ The complexity of self-regular proximity based infeasible IPMs ⋮ On the solution of linear programs by Jacobian smoothing methods ⋮ A predictor-corrector algorithm for linear optimization based on a modified Newton direction ⋮ Shape optimization of piezoelectric sensors or actuators for the control of plates ⋮ Augmented sparse reconstruction of protein signaling networks ⋮ Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming ⋮ Blind Deconvolution Using a Regularized Structured Total Least Norm Algorithm ⋮ Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming ⋮ A polynomial projection algorithm for linear feasibility problems ⋮ A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION ⋮ Approximating high-dimensional dynamics by barycentric coordinates with linear programming ⋮ An efficient linear programming solver for optimal filter synthesis ⋮ On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems ⋮ MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ On a primal-dual analytic center cutting plane method for variational inequalities ⋮ Polynomial chaos representation of a stochastic preconditioner ⋮ Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^† ⋮ User'S guide To Lipsol linear-programming interior point solvers V0.4 ⋮ PCx: an interior-point code for linear programming ⋮ Benchmarking interior point Lp/Qp solvers ⋮ On the Identification of Zero Variables in an Interior-Point Framework ⋮ Parallel interior-point method for linear and quadratic programs with special structure ⋮ A self-adjusting interior point algorithm for linear complementarity problems ⋮ Improving an interior-point approach for large block-angular problems by hybrid preconditioners ⋮ Active-set prediction for interior point methods using controlled perturbations ⋮ Fast Core Pricing for Rich Advertising Auctions

This page was built for software: LIPSOL