Parallel method of conjugate directions for minimization
Parallelization of a ray tracer using the SANEG algorithm.
Parameter optimization in nonzero-sum differential games
Partitioned Variable Metric Updates for Large Structured Optimization Problems.
Penalty method algorithm for fuzzy linear fractional optimization.
Penalty/barrier path-following in linearly constrained optimization
In the present paper rather general penalty/barrier path-following methods (e.g. with p-th power penalties, logarithmic barriers, SUMT, exponential penalties) applied to linearly constrained convex optimization problems are studied. In particular, unlike in previous studies [1,11], here simultaneously different types of penalty/barrier embeddings are included. Together with the assumed 2nd order sufficient optimality conditions this required a significant change in proving the local existence of...
Pricing for sparsity in the revised simplex method
Primena srednjih pruga na linearno programiranje
Problème de la bipartition minimale d'un graphe
Problèmes de partitionnement : exploration arborescente ou méthode de troncatures ?
Projection method with level control in convex minimization
We study a projection method with level control for nonsmoooth convex minimization problems. We introduce a changeable level parameter to level control. The level estimates the minimal value of the objective function and is updated in each iteration. We analyse the convergence and estimate the efficiency of this method.
Projection method with residual selection for linear feasibility problems
We propose a new projection method for linear feasibility problems. The method is based on the so called residual selection model. We present numerical results for some test problems.
Projective algorithms for solving complementarity problems.