Interior-point algorithms for a generalization of linear programming and weighted centring
From MaRDI portal
Publication:5200552
Recommendations
- Weighted complementarity problems -- A new paradigm for computing equilibria
- scientific article; zbMATH DE number 409894
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
- A scaling technique for finding the weighted analytic center of a polytope
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
Cites work
- A new polynomial-time algorithm for linear programming
- A nonlinear allocation problem
- A path to the Arrow-Debreu competitive market equilibrium
- A scaling technique for finding the weighted analytic center of a polytope
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Computing Maximum Likelihood Estimators of Convex Density Functions
- Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
Cited in
(19)- A scaling technique for finding the weighted analytic center of a polytope
- Solving LP Problems via Weighted Centers
- A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP
- A full-Newton step feasible interior-point algorithm for solving the general Fisher market equilibrium
- A smoothing Newton algorithm for weighted linear complementarity problem
- Sufficient weighted complementarity problems
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
- A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
- A full-Newton step interior-point method for monotone weighted linear complementarity problems
- The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra
- Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems
- Kernel-based full-Newton step feasible interior-point algorithm for \(P_* (\kappa)\)-weighted linear complementarity problem
- Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- A modified damped Gauss-Newton method for non-monotone weighted linear complementarity problems
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
- On weighted centers for semidefinite programming
This page was built for publication: Interior-point algorithms for a generalization of linear programming and weighted centring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200552)
