The following pages link to (Q4206561):
Displaying 50 items.
- Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
- A QMR-based interior-point algorithm for solving linear programs (Q1361110) (← links)
- The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
- A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
- Deriving potential functions via a symmetry principle for nonlinear equations (Q1375121) (← links)
- Properties of a homotopy solution path for complementarity problems with quasi-monotone mappings. (Q1415265) (← links)
- A sublinear parallel algorithm for stable matching (Q1575960) (← links)
- On weighted centers for semidefinite programming (Q1584796) (← links)
- Interior-point methods (Q1593831) (← links)
- A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) (← links)
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term (Q1730836) (← links)
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function (Q1785406) (← links)
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions (Q1790186) (← links)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming (Q1803608) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- Multiple centrality corrections in a primal-dual method for linear programming (Q1816400) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- Differential-algebraic approach to linear programming (Q1862190) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← links)
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Primal-dual methods for linear programming (Q1924065) (← links)
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights (Q1977257) (← links)
- A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound (Q2038473) (← links)
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function (Q2053067) (← 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)
- 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 corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
- On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
- A generic kernel function for interior point methods (Q2245691) (← links)
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function (Q2252687) (← links)
- An adaptive updating full-Newton step interior-point algorithm with modified Newton direction (Q2261941) (← links)
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming (Q2273110) (← 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)
- Advances in the simulation of viscoplastic fluid flows using interior-point methods (Q2310212) (← 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)
- Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming (Q2420822) (← links)
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141) (← links)
- A path to the Arrow-Debreu competitive market equilibrium (Q2467155) (← links)
- The asymptotic Browder Hartman Stampacchia condition and interior bands of \(\varepsilon\)-solutions for nonlinear complementarity problems (Q2478062) (← links)
