scientific article; zbMATH DE number 4164543
From MaRDI portal
Publication:3491304
Recommendations
Cited in
(only showing first 100 items - show all)- Note on implementing the new sphere method for LP using matrix inversions sparingly
- A globally convergent interior point algorithm for non-convex nonlinear programming
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- New trajectory-following polynomial-time algorithm for linear programming problems
- A new continuation method for complementarity problems with uniform P- functions
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- An optimal-basis identification technique for interior-point linear programming algorithms
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A survey of search directions in interior point methods for linear programming
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
- Unified complexity analysis for Newton LP methods
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
- On the convergence rate of the duality gap in a symmetric primal-dual potential reduction algorithm
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
- A new polynomial time method for a linear complementarity problem
- Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
- On the long-step path-following method for semidefinite programming
- Feasible direction interior-point technique for nonlinear optimization
- Long-step primal path-following algorithm for monotone variational inequality problems
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- A parallel interior point algorithm for linear programming on a network of transputers
- A primal-dual infeasible-interior-point algorithm for linear programming
- A multiobjective interior primal-dual linear programming algorithm
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
- Solving symmetric indefinite systems in an interior-point method for linear programming
- On the big \({\mathcal M}\) in the affine scaling algorithm
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- A globally convergent primal-dual interior point algorithm for convex programming
- Rank-one techniques in log-barrier function methods for linear programming
- Global convergence in infeasible-interior-point algorithms
- Interior-point algorithms for semi-infinite programming
- Superlinear convergence of infeasible-interior-point methods for linear programming
- Primal-dual algorithms for linear programming based on the logarithmic barrier method
- Constant potential primal-dual algorithms: A framework
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A combined homotopy interior point method for general nonlinear programming problems
- Fast convergence of the simplified largest step path following algorithm
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- A QMR-based interior-point algorithm for solving linear programs
- The largest step path following algorithm for monotone linear complementarity problems
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- A combined homotopy interior point method for convex nonlinear programming
- An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points
- A path-following version of the Todd-Burrell procedure for linear programming
- An extension of predictor-corrector algorithm to a class of convex separable program
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- On weighted centers for semidefinite programming
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function
- On self-regular IPMs (with comments and rejoinder)
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- On the convergence of primal-dual interior-point methods with wide neighborhoods
- Polynomial affine algorithms for linear programming
- An interior point potential reduction method for constrained equations
- Multiple centrality corrections in a primal-dual method for linear programming
- On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method
- A simple complexity proof for a polynomial-time linear programming algorithm
- Differential-algebraic approach to linear programming
- Primal-dual Newton-type interior-point method for topology optimization
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- A generalized homogeneous and self-dual algorithm for linear programming
- The implementation of linear programming algorithms based on homotopies
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
- An infeasible-interior-point algorithm using projections onto a convex set
- Primal-dual target-following algorithms for linear programming
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- Primal-dual methods for linear programming
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics
- A survey on conic relaxations of optimal power flow problem
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- Status determination by interior-point methods for convex optimization problems in domain-driven form
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
- A generic kernel function for interior point methods
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- A primal-dual predictor-corrector interior point method for non-smooth contact dynamics
- On the convergence analysis of arc search interior point methods for LCPs
- An interior-point method for P_*()-linear complementarity problem based on a trigonometric kernel function
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- Determination of optimal vertices from feasible solutions in unimodular linear programming
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- Introduction to duality in optimization theory
- Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
- An O(n^ 3L) primal interior point algorithm for convex quadratic programming
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils
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 Q3491304)
