The following pages link to (Q5691079):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
- Sparse block factorization of saddle point matrices (Q281977) (← links)
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood (Q306400) (← links)
- Crash start of interior point methods (Q323526) (← links)
- A logarithmic barrier approach for linear programming (Q329787) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional (Q350070) (← links)
- A Newton method for solving continuous multiple material minimum compliance problems (Q373922) (← links)
- Techniques for exploring the suboptimal set (Q374684) (← links)
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem (Q376771) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics (Q381248) (← links)
- A 99 line code for discretized Michell truss optimization written in Mathematica (Q381558) (← links)
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
- CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- Equilibration techniques for solving contact problems with Coulomb friction (Q423554) (← links)
- An adaptive-step primal-dual interior point algorithm for linear optimization (Q425813) (← links)
- Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
- Matrix-free interior point method (Q429480) (← links)
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
- Path-following for optimal control of stationary variational inequalities (Q429514) (← links)
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- An interior-exterior approach for convex quadratic programming (Q436003) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- A preconditioning technique for Schur complement systems arising in stochastic optimization (Q453622) (← links)
- Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization (Q462993) (← links)
- Parametric variational solution of linear-quadratic optimal control problems with control inequality constraints (Q468571) (← links)
- Mixed finite element solutions to contact problems of nonlinear Gao beam on elastic foundation (Q475035) (← links)
- qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
- A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
- Simultaneous nonlinear model predictive control and state estimation (Q510104) (← links)
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) (← links)
- A variation on the interior point method for linear programming using the continued iteration (Q522093) (← links)
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming (Q522098) (← links)
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
- A warm-start approach for large-scale stochastic linear programs (Q535016) (← links)
- Exploiting separability in large-scale linear support vector machine training (Q540649) (← links)
- A multigrid method for constrained optimal control problems (Q550102) (← links)
- Fast unconditionally stable 2-D analysis of non-conjugate gear contacts using an explicit formulation of the meshing equations (Q553631) (← links)
- High-order Newton-penalty algorithms (Q557745) (← links)
- An infeasible-start path-following method for monotone LCPs (Q597439) (← links)
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (Q606335) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
