scientific article; zbMATH DE number 3972641
From MaRDI portal
Publication:3738934
Recommendations
Cited in
(81)- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
- An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope
- A polynomial-time algorithm, based on Newton's method, for linear programming
- On some efficient interior point methods for nonlinear convex programming
- Karmarkar's linear programming algorithm and Newton's method
- Method of centers for minimizing generalized eigenvalues
- Solving an equilibrium model for trade of \(\text{CO}_2\) emission permits
- A global Newton method. II: Analytic centers
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- Optimal ellipsoidal approximations around the analytic center
- A combined homotopy interior point method for general nonlinear programming problems
- A combined homotopy interior point method for convex nonlinear programming
- A new characterization of the center of a polytope
- A conjugate direction method for approximating the analytic center of a polytope
- On improved Choi-Goldfarb solution-containing ellipsoids in linear programming
- Pivot versus interior point methods: Pros and cons
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- The asymptotic optimal partition and extensions of the nonsubstitution theorem
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- Probing the arrangement of hyperplanes
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- Analytic centers and repelling inequalities
- An interior method for nonconvex semidefinite programs
- An interior-point method for multifractional programs with convex constraints
- An interior-point method for semi-infinite programming problems
- New complexity results for the Iri-Imai method
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function
- A corrector-predictor interior-point method with new search direction for linear optimization
- On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
- Ten years of feasibility pump, and counting
- Approximate cone factorizations and lifts of polytopes
- A finite termination Mehrotra-type predictor-corrector algorithm
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
- A polynomial path following algorithm for convex programming
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- scientific article; zbMATH DE number 4041641 (Why is no real title available?)
- scientific article; zbMATH DE number 4102820 (Why is no real title available?)
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- scientific article; zbMATH DE number 4121751 (Why is no real title available?)
- Computation of the distance to semi-algebraic sets
- Ragnar Frisch and interior-point methods
- Deepest point of a polyhedron and linear programming
- An ADMM-based interior-point method for large-scale linear programming
- An interior point approach for linear complementarity problem using new parametrized kernel function
- Probing a set of hyperplanes by lines and related problems
- Ellipsoidal methods for adaptive choice-based conjoint analysis
- An adaptive self-regular proximity-based large-update IPM for LO
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function
- An easy way to teach interior-point methods.
- Maintaining closeness to the analytic center of a polytope by perturbing added hyperplanes
- Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
- A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- Sufficient matrices: properties, generating and testing
- Using central prices in the decomposition of linear programs
- New interior-point algorithm for linear optimization based on a universal tangent direction
- A scaling technique for finding the weighted analytic center of a polytope
- A long-step second-order corrector interior point algorithm for linear optimization based on the algebraic equivalent transformation
- Remarks on the analytic centers of convex sets
- An interior-point algorithm for linear optimization based on a new barrier function
- An efficient 2-parameter hyperbolic kernel-function-based interior-point method for linear programming
- An efficient parameterized logarithmic kernel function for linear optimization
- New method for determining search directions for interior-point algorithms in linear optimization
- A new parametric kernel function based on p-generalized sigmoid function for the primal-dual interior point method of linear optimization
- New interior-point methods for linear optimization problem
- Parabolic target-space interior-point algorithm for monotone weighted linear complementarity problem
- An efficient twice parameterized trigonometric kernel function for linear optimization
- The relation between the path of centers and Smale's regularization of the linear programming problem
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738934)
