A class of new search directions for full-NT step feasible interior point method in semidefinite optimization [PDF]
, 2022 In this paper, based on Darvay et al.’s strategy for linear optimization (LO) (Z. Darvay and P.R. Takács, Optim. Lett. 12 (2018) 1099–1116.), we extend Kheirfam et al.’s feasible primal-dual path-following interior point algorithm for LO (B. Kheirfam and
Loubna Guerra
core +1 more source
A Novel 4D-CT Sorting Method Based on Combined Mutual Information and Edge Gradient
IEEE Access, 2019 Although mutual information is a general method usually being used to measure the similarity of two images, the robustness is questionable due to the absence of spatial information. The purpose of this study is to develop a feasible sorting technique for
Juan Yang +3 more
doaj +1 more source
A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization [PDF]
, 2007 In this work, combining the properties of the generalized super-memory gradient projection methods with the ideas of the strongly sub-feasible directions methods, we present a new algorithm with strong convergence for nonlinear inequality constrained ...
Tang, Chun-Ming +2 more
core +1 more source
A feasible descent cone method for linearly constrained minimization problems [PDF]
, 1994 An improvement over an earlier feasible directions minimization algorithm is presented. In a certain sense the new feasible descent cone algorithm is shown to be a generalization of Rosen's gradient projection method.
Snyman, J.A. +3 more
core +1 more source
Feasible algorithms for lattice and directed subspaces
Mathematical Proceedings of the Royal Irish Academy, 2014 Summary: In some practical situations (e.g., in econometrics), it is important to check whether a given linear subspace of a space \(\mathbb R^m\) with component-wise order is a lattice -- and if it is not, whether it is at least a directed ordered space. Because of the practical importance, it is desirable to have feasible algorithms for solving these
Del Valle, Jennifer (Hamlyn) +2 more
openaire +3 more sources
A New Full-Newton Step $O(n)$ Infeasible Interior-Point Algorithm for $P_*(\kappa)$-horizontal Linear Complementarity Problems [PDF]
Computer Science Journal of Moldova, 2014 In this paper, we first present a brief review about the feasible interior-point algorithm for $P_*(\kappa)$-horizontal linear complementarity problems (HLCPs) based on new directions.
Soodabeh Asadi, Hossein Mansouri
doaj
A global pricing extension of the simplex method [PDF]
Operations Research and DecisionsWe introduce the use of a global, nonlinear price function in linear programming and the simplex method. The usual, linear price function of this method captures the objective's behaviour over the cone of directions defined by the nonbasic columns ...
Biressaw C. Wolde, Torbjörn Larsson
doaj +1 more source
A method of feasible directions using function approximations, with applications to min max problems [PDF]
, 1973 This paper presents a demonstrably convergent method of feasible directions for solving the problem min{φ(ξ)| gi(ξ)⩽0i=1,2,…,m}, which approximates, adaptively, both φ(x) and ▽φ(x).
Klessig, R, Polak, E
core +1 more source
An algorithm of feasible directions to mixed nonlinear complementarity problems and applications [PDF]
, 2017 This work investigates the Feasible Direction Algorithm using interior points applied to the Mixed Nonlinear Complementarity Problem and some applications.
Ramírez Gutiérrez, Ángel Enrique
core +3 more sources
A family of global convergent inexact secant methods for nonconvex constrained optimization
Journal of Algorithms & Computational Technology, 2018 We present a family of new inexact secant methods in association with Armijo line search technique for solving nonconvex constrained optimization. Different from the existing inexact secant methods, the algorithms proposed in this paper need not compute ...
Zhujun Wang, Li Cai, Zheng Peng
doaj +1 more source