Pages that link to "Item:Q4015447"

The following pages link to On the Implementation of a Primal-Dual Interior Point Method (Q4015447):

Displaying 50 items.

• Advanced algorithms for penalized quantile and composite quantile regression (Q1995843) (← links)
• An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
• Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics (Q2006121) (← links)
• A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (Q2012233) (← links)
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization (Q2018491) (← links)
• Interior-point methods for the phase-field approach to brittle and ductile fracture (Q2022059) (← links)
• An interior point-proximal method of multipliers for convex quadratic programming (Q2028483) (← links)
• Multi-target identity management for unknown and time-varying number of targets in clutter (Q2034229) (← links)
• An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
• An interior-point algorithm for linear programming with optimal selection of centering parameter and step size (Q2059175) (← links)
• Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
• A Hamiltonian decomposition for fast interior-point solvers in model predictive control (Q2065167) (← links)
• An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199) (← links)
• A predictor-corrector affine scaling method to train optimized extreme learning machine (Q2071232) (← links)
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
• \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
• An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
• A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
• A generalized multigrid method for solving contact problems in Lagrange multiplier based unfitted finite element method (Q2138666) (← links)
• A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization (Q2149553) (← links)
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
• An efficient method for solving multi-objective signomial programming problems in real life (Q2170947) (← links)
• Learning to steer nonlinear interior-point methods (Q2175369) (← links)
• A new proposal to improve the early iterations in the interior point method (Q2178307) (← links)
• Interior/exterior-point methods with inertia correction strategy for solving optimal reactive power flow problems with discrete variables (Q2178348) (← links)
• Towards an efficient augmented Lagrangian method for convex quadratic programming (Q2191789) (← links)
• A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
• Convex optimization techniques in compliant assembly simulation (Q2218917) (← links)
• Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming (Q2219452) (← links)
• Implementation of an interior point method with basis preconditioning (Q2220915) (← links)
• A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood (Q2221151) (← links)
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
• COSMO: a conic operator splitting method for convex conic problems (Q2231337) (← links)
• Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method (Q2244972) (← links)
• Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization (Q2250064) (← links)
• A scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors (Q2254755) (← links)
• A Mehrotra type predictor-corrector interior-point algorithm for linear programming (Q2273110) (← links)
• A new method for classifying random variables based on support vector machine (Q2283324) (← links)
• A least squares-type density estimator using a polynomial function (Q2291316) (← links)
• A primal-dual predictor-corrector interior point method for non-smooth contact dynamics (Q2310211) (← links)
• Advances in the simulation of viscoplastic fluid flows using interior-point methods (Q2310212) (← links)
• A corrector-predictor arc search interior-point algorithm for symmetric optimization (Q2313142) (← links)
• Quasi-Newton approaches to interior point methods for quadratic problems (Q2322554) (← links)
• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
• On the convergence analysis of arc search interior point methods for LCPs (Q2337791) (← links)
• An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
• On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
• A new predictor-corrector method for optimal power flow (Q2357901) (← links)
• Data fitting with geometric-programming-compatible softmax functions (Q2358087) (← links)
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)