Results 41 to 50 of about 15,480,478 (99)
The optimal expansion of unbalanced three-phase distribution networks in non-interconnected zones requires the simultaneous resolution of two highly complex planning decisions: the selection of feeder routes and the sizing of conductors.
Brandon Cortés-Caicedo +2 more
doaj +1 more source
AN INTERIOR-POINT METHOD FOR MPECs BASED ON STRICTLY FEASIBLE RELAXATIONS. [PDF]
An interior-point method for solving mathematical programs with equilibrium constraints (MPECs) is proposed. At each iteration of the algorithm, a single primaldual step is computed from each subproblem of a sequence.
Michael P. Friedlander +3 more
core
Polynomial Convergence of Infeasible-Interior-Point Methods Over Symmetric Cones [PDF]
Polynomial Convergence of Infeasible-Interior-Point Methods Over Symmetric ...
Rangarajan, B.
core +2 more sources
Interior Point Methods for Massive Support Vector Machines [PDF]
We investigate the use of interior point methods for solving quadratic programming problems with a small number of linear constraints where the quadratic term consists of a low-rank update to a positive semi-de nite matrix. Several formulations of the
Ferris, Michael, Munson, Todd
core
An Infeasible-Interior-Point Potential-Reduction Algorithm for Linear Programming [PDF]
An Infeasible-Interior-Point Potential-Reduction Algorithm for Linear ...
Tutuncu, R.
core +2 more sources
Structure optimization of jacquard lifting knife on NURBS curve
In view of the problem that large jacquard machine was prone to bending deformation when bearing load, resulting in insufficient lifting height of lifting knife, so that the straight needle hook can not be caught by the electromagnetic device.
YANG ZhenNing, LI YuLiang
doaj
A Truncated Primal-Infeasible Dual-Feasible Network Interior Point Method
. In this paper we introduce the truncated primal-infeasible dual-feasible interior point algorithm for linear programming and describe an implementation of this algorithm for solving the minimum cost network flow problem.
G. Veiga +5 more
core
COUNTER EXAMPLE TO A CONJECTURE ON INFEASIBLE INTERIOR-POINT METHODS
. Based on extensive computational evidence (hundreds of thousands of randomly generated problems) the second author conjectured that ¯κ(ζ) = 1 (Conjecture 5.1 in [1]), which is a factor of √ 2n better than has been proved in [1], and which would yield ...
G. Gu, C. Roos
core
Semidefinite Programming (SDP) involves the optimization of a linear cost function subject to linear constraints over symmetric positive semidefinite matrix variables.
Qian Xia
core
An infeasible Predictor-Corrector Interior Point Method Applied to Image Denoising
Image recovery problems can be solved using optimization techniques. In this case, they often lead to the resolution of either a large scale quadratic program, or, equivalently, to a nondifferentiable minimization problem. Interior point methods are widely known for their efficiency in linear programming. Lately, they have been extended with success to
Pola, Cecilia, Sagastizábal, Claudia
openaire +1 more source

