Results 11 to 20 of about 1,196 (89)
Iterative algorithms with seminorm‐induced oblique projections
Abstract and Applied Analysis, Volume 2003, Issue 7, Page 387-406, 2003., 2003 A definition of oblique projections onto closed convex sets that use seminorms induced by diagonal matrices which may have zeros on the diagonal is introduced. Existence and uniqueness of such projections are secured via directional affinity of the sets with respect to the diagonal matrices involved. A block‐iterative algorithmic scheme for solving the
Yair Censor, Tommy Elfving
wiley +1 more source
Convergence of a short‐step primal‐dual algorithm based on the Gauss‐Newton direction
Journal of Applied Mathematics, Volume 2003, Issue 10, Page 517-534, 2003., 2003 We prove the theoretical convergence of a short‐step, approximate path‐following, interior‐point primal‐dual algorithm for semidefinite programs based on the Gauss‐Newton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the first proof of convergence for the Gauss‐Newton direction in this context.
Serge Kruk, Henry Wolkowicz
wiley +1 more source
Implementation of LDG method for 3D unstructured meshes
Revista de Matemática: Teoría y Aplicaciones, 2012 This paper describes an implementation of the Local Discontinuous Galerkin method (LDG) applied to elliptic problems in 3D. The implementation of the major operators is discussed.
Filander A. Sequeira Chavarría +1 more
doaj +1 more source
About the Algebraic Solutions of Smallest Enclosing Cylinders Problems [PDF]
, 2011 Given n points in Euclidean space E^d, we propose an algebraic algorithm to compute the best fitting (d-1)-cylinder. This algorithm computes the unknown direction of the axis of the cylinder.
E. Schömer +11 more
core +1 more source
An entropic regularization method for solving systems of fuzzy linear inequalities
International Journal of Mathematics and Mathematical Sciences, Volume 32, Issue 10, Page 579-585, 2002., 2002 Solving systems of fuzzy linear inequalities could lead to the solutions of fuzzy linear programs. It is shown that a system of fuzzy linear inequalities can be converted to a regular min‐max problem. An entropic regularization method is introduced for solving such a problem. Some computational results are included.
F. B. Liu
wiley +1 more source
Restrict-and-relax search for 0-1 mixed-integer programs
EURO Journal on Computational Optimization, 2013 A highly desirable characteristic of methods for solving 0-1 mixed-integer programs is that they should be capable of producing high-quality solutions quickly.
Menal Guzelsoy +2 more
doaj +1 more source
A global method for some class of optimization and control problems
International Journal of Mathematics and Mathematical Sciences, Volume 23, Issue 9, Page 605-616, 2000., 2000 The problem of maximizing a nonsmooth convex function over an arbitrary set is considered. Based on the optimality condition obtained by Strekalovsky in 1987 an algorithm for solving the problem is proposed. We show that the algorithm can be applied to the nonconvex optimal control problem as well.
R. Enkhbat
wiley +1 more source
Results in Applied Mathematics, 2019 In this article, we propose a three-term conjugate gradient projection algorithm for solving constrained monotone nonlinear equations. The global convergence of the algorithm was established under suitable assumptions.
Auwal Bala Abubakar +2 more
doaj +1 more source
Adaptive First-Order Methods for General Sparse Inverse Covariance Selection [PDF]
, 2009 In this paper, we consider estimating sparse inverse covariance of a Gaussian graphical model whose conditional independence is assumed to be partially known.
Lu, Zhaosong
core +3 more sources
Convergence analysis of the iterative methods for quasi complementarity problems
International Journal of Mathematics and Mathematical Sciences, Volume 11, Issue 2, Page 319-334, 1988., 1988 In this paper, we consider the iterative methods for the quasi complementarity problems of the form where m is a point‐to‐point mapping and T is a continuous mapping from Rn into itself. The algorithms considered in this paper are general and unified ones, which include many existing algorithms as special cases for solving the complementarity problems.
Muhammad Aslam Noor
wiley +1 more source