Pages that link to "Item:Q1123122"

The following pages link to Interior path following primal-dual algorithms. II: Convex quadratic programming (Q1123122):

Displaying 50 items.

• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
• A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
• An extension of predictor-corrector algorithm to a class of convex separable program (Q1375337) (← links)
• Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space (Q1379935) (← links)
• A non-interior path following method for convex quadratic programming problems with bound constraints (Q1430274) (← links)
• Piecewise linear programming via interior points (Q1582686) (← links)
• Higher-order derivatives in linear and quadratic programming (Q1592581) (← links)
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (Q1644574) (← links)
• A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) (← links)
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
• The fairest core in cooperative games with transferable utilities (Q1785318) (← links)
• A continuation algorithm for a class of linear complementarity problems using an extrapolation technique (Q1801456) (← links)
• Symmetric indefinite systems for interior point methods (Q1803613) (← links)
• On well definedness of the central path (Q1807813) (← links)
• Containing and shrinking ellipsoids in the path-following algorithm (Q1813834) (← links)
• Computing Karmarkar's projections quickly by using matrix factorization (Q1815744) (← links)
• Numerical comparisons of path-following strategies for a primal-dual interior-point method for nonlinear programming (Q1862179) (← links)
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem (Q1906276) (← links)
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
• A relaxed primal-dual path-following algorithm for linear programming (Q1915911) (← links)
• Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
• Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems (Q1919097) (← links)
• New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
• A primal-dual potential reduction method for problems involving matrix inequalities (Q1922696) (← links)
• Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← links)
• Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier (Q1935397) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
• Resource-aware networked control systems under temporal logic specifications (Q2177771) (← links)
• Sensor selection strategies for state estimation in energy constrained wireless sensor networks (Q2276100) (← links)
• Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
• A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions (Q2316302) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605) (← links)
• Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
• Efficient regularized isotonic regression with application to gene-gene interaction search (Q2428745) (← links)
• Steplength selection in interior-point methods for quadratic programming (Q2455431) (← links)
• On some properties and an application of the logarithmic barrier method (Q2467165) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• An algorithm for portfolio optimization with variable transaction costs. II: Computational analysis (Q2483030) (← links)
• Optimization of algorithmic parameters using a meta-control approach (Q2494481) (← links)
• A primal-dual interior-point algorithm for quadratic programming (Q2502230) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
• A polynomial-time algorithm for affine variational inequalities (Q2639604) (← links)
• Fitting a graph to one-dimensional data (Q2663044) (← links)
• An interior point algorithm for global optimal solutions and KKT points (Q2770190) (← links)
• Taking all positive eigenvectors is suboptimal in classical multidimensional scaling (Q2828334) (← links)