LIPSOL

swMATH4712MaRDI QIDQ16880FDOQ16880

Author name not available (Why is that?)

Cited In (86)

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

This page was built for software: LIPSOL