An interior point potential reduction method for constrained equations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4131946 (Why is no real title available?)
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 3694049 (Why is no real title available?)
- scientific article; zbMATH DE number 3788387 (Why is no real title available?)
- scientific article; zbMATH DE number 51872 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 757678 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Centered Projective Algorithm for Linear Programming
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
- A Positive Algorithm for the Nonlinear Complementarity Problem
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- A class of linear complementarity problems solvable in polynomial time
- A globally convergent primal-dual interior point algorithm for convex programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
- A set of geometric programming test problems and their solutions
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An Algorithm for Large-Scale Quadratic Programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An interior point potential reduction algorithm for the linear complementarity problem
- Commentary—Theory and Practice for Interior-Point Methods
- Computational experience with a primal-dual interior point method for linear programming
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
- Convex Analysis
- Feasibility issues in a primal-dual interior-point method for linear programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Global convergence in infeasible-interior-point algorithms
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- Interior path following primal-dual algorithms. I: Linear programming
- Interior-point methods for nonlinear complementarity problems
- Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
- On Dynamic Multi‐Rigid‐Body Contact Problems with Coulomb Friction
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
- Path-Following Methods for Linear Programming
- Properties of an Interior-Point Mapping for Mixed Complementarity Problems
- Symmetric Quasidefinite Matrices
- Test examples for nonlinear programming codes
- The Extended Linear Complementarity Problem
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
Cited in
(21)- A non-interior implicit smoothing approach to complementarity problems for frictionless contacts
- On affine-scaling inexact dogleg methods for bound-constrained nonlinear systems
- Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Constrained dogleg methods for nonlinear systems with simple bounds
- An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions
- A potential reduction method for tensor complementarity problems
- The reformulation of nonlinear complementarity problems using the Fischer-Burmeister function
- Multivariate encryption schemes based on polynomial equations over real numbers
- A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations
- Globalization technique for projected Newton-Krylov methods
- An interior point method for solving systems of linear equations and inequalities
- An SQP method for general nonlinear complementarity problems
- Tensor complementarity problems. II: Solution methods
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- Starting-point strategies for an infeasible potential reduction method
- Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Feasible direction interior-point technique for nonlinear optimization
- An interior global method for nonlinear systems with simple bounds
- Inexact interior-point method
- Formulation and comparison of algorithms for frictional contact problems
This page was built for publication: An interior point potential reduction method for constrained equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814789)
