Results 21 to 30 of about 15,567,490 (268)
EURO Journal on Computational Optimization, 2023 We introduce a new predictor-corrector interior-point algorithm for solving P⁎(κ)-linear complementarity problems which works in a wide neighbourhood of the central path.
Tibor Illés +2 more
doaj +1 more source
Journal of Computational and Applied Mathematics, 2000 The simplex method starts from a basic feasible solution and moves along the boundary of the feasible region until an optimum is reached. At each step, the algorithm brings only one new variable into the basic set, regardless of the total number of variables.
Potra, Florian A., Wright, Stephen J.
+4 more sources
Experimental investigation of an interior search method within a simple framework [PDF]
, 1986 A steepest gradient method for solving Linear Programming (LP) problems, followed by a procedure for purifying a non-basic solution to an improved extreme point solution have been embedded within an otherwise simplex based optimiser.
Mitra, G, Yadeger, J, Tamiz, M
core +6 more sources
Optimal Load Shedding in Deregulated System and Consideration of Effective Factors by Using a Predictor-Corrector Interior-Point Method (IPM) [PDF]
Journal of Intelligent Procedures in Electrical Technology, 2010 In this paper, intifially an introduction is presented about Electric Power market in deregulated system and load shedding by interior-point method in these systems. Then, predictor-corrector of IPM is considered and by consideration of the IEEE 6 busbar
Mojtaba Afshari, Saeed Abazari
doaj
On Implementing a Two-Step Interior Point Method for Solving Linear Programs
AlgorithmsA new two-step interior point method for solving linear programs is presented. The technique uses a convex combination of the auxiliary and central points to compute the search direction.
Sajad Fathi Hafshejani +2 more
doaj +1 more source
Homotopy Interior-Point Method for a General Multiobjective Programming Problem
Journal of Applied Mathematics, 2012 We present a combined homotopy interior-point method for a general multiobjective programming problem. For solving the KKT points of the multiobjective programming problem, the homotopy equation is constructed. We prove the existence and convergence of a
X. Zhao, S. G. Zhang, Q. H. Liu
doaj +1 more source
Matrix Structure Driven Interior Point Method for Quadrotor Real-Time Trajectory Planning
IEEE Access, 2019 Sequential convex programming (SCP) has been recently employed in various trajectory planning problems, including entry flight, planetary landing, and aircraft formation.
Guangtong Xu +3 more
doaj +1 more source
Noise-Based Frequency Spectrum Correction Method Using Interior Point Approach
IEEE AccessThe spectral correction of noisy real sinusoidal signals is of critical importance; however, the presence of spectral leakage and noise introduces significant challenges.
Guichun Yang +6 more
doaj +1 more source
A new non-monotonic infeasible simplex-type algorithm for Linear Programming [PDF]
PeerJ Computer Science, 2020 This paper presents a new simplex-type algorithm for Linear Programming with the following two main characteristics: (i) the algorithm computes basic solutions which are neither primal or dual feasible, nor monotonically improving and (ii) the sequence ...
Charalampos P. Triantafyllidis +1 more
doaj +2 more sources
On the relationship between bilevel decomposition algorithms and direct interior-point methods [PDF]
, 2004 Engineers have been using bilevel decomposition algorithms to solve certain nonconvex large-scale optimization problems arising in engineering design projects.
Miguel, Angel Víctor de +3 more
core +1 more source