Pages that link to "Item:Q1123121"
From MaRDI portal
The following pages link to Interior path following primal-dual algorithms. I: Linear programming (Q1123121):
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)
- Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- New infeasible interior-point algorithm based on monomial method (Q1919774) (← 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)
- Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme (Q2070401) (← 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)
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (Q2218879) (← links)
- A generic kernel function for interior point methods (Q2245691) (← links)
- An adversarial optimization approach to efficient outlier removal (Q2251235) (← links)
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function (Q2252687) (← 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)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← 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)
- Determination of optimal vertices from feasible solutions in unimodular linear programming (Q2366606) (← links)
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
- A path to the Arrow-Debreu competitive market equilibrium (Q2467155) (← links)
- On some properties and an application of the logarithmic barrier method (Q2467165) (← links)
- The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems (Q2478062) (← links)
- Improved complexity results on solving real-number linear feasibility problems (Q2490340) (← links)
- Optimization of algorithmic parameters using a meta-control approach (Q2494481) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- Introduction to duality in optimization theory (Q2564160) (← links)
- An exterior-point method for linear programming problems (Q2564164) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine (Q2784423) (← links)
- An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization (Q2802529) (← links)
- An accelerated interior point method whose running time depends only on \(A\) (extended abstract) (Q2817643) (← links)
- Some convergence results for primal-dual interior point algorithm for linear programming (Q2899948) (← links)
- Solving scalarized multi-objective network flow problems using an interior point method (Q3002548) (← links)
- Kernel-function Based Primal-Dual Algorithms for<i>P</i><sub><sub>*</sub></sub>(<i>κ</i>) Linear Complementarity Problems (Q3057529) (← links)
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)
- A New Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming (Q3188443) (← links)
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence (Q3491323) (← links)
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
- A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization (Q3640925) (← links)
- A path following algorithm for a class of convex programming problems (Q4016864) (← links)
- Further Development of a Primal-Dual Interior Point Method (Q4025908) (← links)
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem (Q4266399) (← links)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming (Q4286944) (← links)
- A primal‐dual interior-point method for linear optimization based on a new proximity function (Q4405935) (← links)
- THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS (Q4548041) (← links)
- Interior Point Algorithms in Linear Optimization (Q4553648) (← links)
