A feasible direction method for linear programming [PDF]
Operations Research Letters, 1984 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Murty, Katta G., Fathi, Yahya
openaire +5 more sources
A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming [PDF]
Journal of Applied Mathematics, 2013 Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation ...
Xuewen Mu, Yaling Zhang
doaj +2 more sources
A Conjugate Gradient Type Method for the Nonnegative Constraints Optimization Problems [PDF]
Journal of Applied Mathematics, 2013 We are concerned with the nonnegative constraints optimization problems. It is well known that the conjugate gradient methods are efficient methods for solving large-scale unconstrained optimization problems due to their simplicity and low storage ...
Can Li
doaj +2 more sources
Method of Feasible Directions with Hit-and-Run Sampling for Solving Linearly Constrained Multi-Objective Optimization Problems [PDF]
Journal of Optimization, Differential Equations and Their ApplicationsThis paper proposes an extension of Zoutendijk’s Method of Feasible Directions (MFD) for solving linearly constrained multi-objective optimization problems.
Ramdani Zoubir +2 more
doaj +3 more sources
A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming [PDF]
Journal of Inequalities and Applications, 2017 This paper introduces a symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming with linear equality constraints, which inherits the superiorities of the classical alternating direction ...
Jing Liu, Yongrui Duan, Min Sun
doaj +2 more sources
TWO TIME-SCALE FEASIBLE DIRECTION METHOD [PDF]
IFAC Proceedings Volumes, 2005 Abstract Stochastic constrained optimization problems with non-convex objective and convex feasible domain are considered for the case where the objective and constraint functions are available only throuth noisy observations. A general algorithm of the two time-scale stochastic approximation type is proposed for these problems.
Vladislav B. Tadić +2 more
openaire +2 more sources
Feasible Direction Methods for Constrained Nonlinear Optimization: Suggestions for Improvements. [PDF]
, 2007 This thesis concerns the development of novel feasible direction type algorithms for constrained nonlinear optimization. The new algorithms are based upon enhancements of the search direction determination and the line search steps. The Frank-Wolfe method is popular for solving certain structured linearly constrained nonlinear problems, although its ...
Mitradjieva-Daneva, Maria
openaire +3 more sources
An interior feasible direction method with constraint projections for linear programming [PDF]
, 1990 A new feasible direction method for linear programming problems is presented. The method is not boundary following. The method proceeds from a feasible interior point in a direction that improves the objective function until a point on a constraint ...
Snyman, J.A.
core +1 more source
Modifying Feasible SQP Method for Inequality Constrained Optimization [PDF]
, 2012 This paper is concerned with an improved feasible sequential quadratic programming (FSQP) method which solves an inequality constrained nonlinear optimization problem.
Zhibin Zhu +5 more
core +1 more source
Global Pricing and Feasible Directions in Linear Programming [PDF]
, 2022 We present a linear programming approach based on a global pricing function and feasible directions. It is embedded in the framework of the simplex method through the use of external columns, which are combinations of original columns. The global pricing
Larsson, Torbjörn, +1 more
core +1 more source