The following pages link to (Q3738934):
Displaying 50 items.
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
- Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization (Q462993) (← links)
- Ragnar Frisch and interior-point methods (Q497438) (← links)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
- Using central prices in the decomposition of linear programs (Q684317) (← links)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
- The relation between the path of centers and Smale's regularization of the linear programming problem (Q803732) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← links)
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
- An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope (Q1106099) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
- Karmarkar's linear programming algorithm and Newton's method (Q1176568) (← links)
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- Solving an equilibrium model for trade of \(\text{CO}_2\) emission permits (Q1291615) (← links)
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215) (← links)
- Optimal ellipsoidal approximations around the analytic center (Q1330921) (← links)
- A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
- A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming (Q1591595) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
- The asymptotic optimal partition and extensions of the nonsubstitution theorem (Q1765893) (← links)
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924) (← links)
- Probing the arrangement of hyperplanes (Q1842647) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- An interior method for nonconvex semidefinite programs (Q1863841) (← links)
- An interior-point method for multifractional programs with convex constraints (Q1893345) (← links)
- An interior-point method for semi-infinite programming problems (Q1915915) (← links)
- New complexity results for the Iri-Imai method (Q1915925) (← links)
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights (Q1977257) (← links)
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function (Q2053067) (← 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 new wide neighborhood primal-dual second-order corrector algorithm for linear optimization (Q2228364) (← links)
- Ten years of feasibility pump, and counting (Q2329705) (← links)
- Approximate cone factorizations and lifts of polytopes (Q2349138) (← links)
- A finite termination Mehrotra-type predictor-corrector algorithm (Q2383922) (← links)
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141) (← links)
- A polynomial path following algorithm for convex programming (Q2479155) (← links)
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765) (← links)
- Computation of the distance to semi-algebraic sets (Q4941311) (← links)
- Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis (Q5126603) (← links)
