The following pages link to (Q3491304):
Displaying 50 items.
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- Primal-dual methods for linear programming (Q1924065) (← links)
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
- Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics (Q2006121) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function (Q2053067) (← links)
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function (Q2053282) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps (Q2192573) (← links)
- A generic kernel function for interior point methods (Q2245691) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term (Q2303523) (← links)
- A primal-dual predictor-corrector interior point method for non-smooth contact dynamics (Q2310211) (← links)
- On the convergence analysis of arc search interior point methods for LCPs (Q2337791) (← links)
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function (Q2346488) (← links)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
- Determination of optimal vertices from feasible solutions in unimodular linear programming (Q2366606) (← links)
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems (Q2458697) (← links)
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems (Q2483352) (← links)
- Introduction to duality in optimization theory (Q2564160) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils (Q2666658) (← links)
- A wide neighborhood predictor-corrector infeasible-interior-point method for Cartesian \(P_* (\kappa)\)-LCP over symmetric cones (Q2818293) (← links)
- Kernel-function Based Primal-Dual Algorithms for<i>P</i><sub><sub>*</sub></sub>(<i>κ</i>) Linear Complementarity Problems (Q3057529) (← links)
- (Q3153265) (← links)
- A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log <i>ϵ</i><sup>−1</sup>) iteration complexity (Q3174878) (← links)
- (Q3348699) (← links)
- (Q3538742) (← links)
- Interior-point algorithm based on general kernel function for monotone linear complementarity problem (Q3572642) (← links)
- (Q3640729) (← links)
- Insights into the interior-point methods (Q4009794) (← links)
- A Low Complexity Interior-Point Algorithm for Linear Programming (Q4018391) (← links)
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming (Q4020667) (← links)
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem (Q4266399) (← links)
- Numerical methods of nonlinear optimal control based on mathematical programming (Q4374282) (← links)
- A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming (Q4521377) (← links)
- Log-Barrier Interior Point Methods Are Not Strongly Polynomial (Q4564017) (← links)
- Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term (Q4596180) (← links)
- An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function (Q4606373) (← links)
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions (Q4639122) (← links)
- Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term (Q4646520) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood (Q4988920) (← links)
- A new second-order corrector interior-point algorithm for P*(k)-LCP (Q5023102) (← links)
