A noninterior path following algorithm for solving a class of multiobjective programming problems
From MaRDI portal
Publication:1719236
DOI10.1155/2014/835819zbMath1407.90304OpenAlexW1988730431WikidataQ59069845 ScholiaQ59069845MaRDI QIDQ1719236
Zhonghai Xu, Zhengbang Zha, Menglong Su
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/835819
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- One-parameter families of optimization problems: equality constraints
- Second-order conditions for efficiency in nonsmooth multiobjective optimization problems
- On the complexity of a combined homotopy interior method for convex programming
- Homotopy method for a general multiobjective programming problem
- Generalizations of fixed point theorems and computation
- Finding the zeros of an analytic function
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A comparison of methods for determining turning points of nonlinear equations
- On some efficient interior point methods for nonlinear convex programming
- A convergent process of price adjustment and global Newton methods
- Test example for nonlinear programming codes
- Homotopy method for solving variational inequalities
- Semi-infinite optimization: Structure and stability of the feasible set
- A combined homotopy interior point method for convex nonlinear programming
- A homotopy method for solving bilevel programming problem
- Homotopy method for a class of nonconvex Brouwer fixed-point problems
- On parametric nonlinear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- Critical sets in parametric optimization
- The Projective SUMT Method for Convex Programming
- An Approach to Homotopy and Degree Theory
- The Homotopy Continuation Method: Numerically Implementable Topological Procedures
- An Algorithm That is Globally Convergent with Probability One for a Class of Nonlinear Two-Point Boundary Value Problems
- On Steplength Algorithms for a Class of Continuation Methods
- A path following algorithm for a class of convex programming problems
- Path-Following Methods for Linear Programming
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- One-Parametric Semi-Infinite Optimization: On the Stability of the Feasible Set
- Introduction to Numerical Continuation Methods
- Numerical Continuation and Singularity Detection Methods for Parametric Nonlinear Programming
- A Constructive Proof of the Poincare-Birkhoff Theorem
- Condition for global convergence of a homotopy method for variational inequality problems on unbounded sets
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
