Page 1 Next

Displaying 1 – 20 of 60

Showing per page

Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming

Jingyong Tang, Li Dong, Liang Fang, Li Sun (2015)

Applications of Mathematics

The smoothing-type algorithm is a powerful tool for solving the second-order cone programming (SOCP), which is in general designed based on a monotone line search. In this paper, we propose a smoothing-type algorithm for solving the SOCP with a non-monotone line search. By using the theory of Euclidean Jordan algebras, we prove that the proposed algorithm is globally and locally quadratically convergent under suitable assumptions. The preliminary numerical results are also reported which indicate...

ANOVA using commutative Jordan algebras, an application

Paulo Canas Rodrigues, João Tiago Mexia (2006)

Discussiones Mathematicae Probability and Statistics

Binary operations on commutative Jordan algebras are used to carry out the ANOVA of a two layer model. The treatments in the first layer nests those in the second layer, that being a sub-model for each treatment in the first layer. We present an application with data retried from agricultural experiments.

Free associative algebras, noncommutative Gröbner bases, and universal associative envelopes for nonassociative structures

Murray R. Bremner (2014)

Commentationes Mathematicae Universitatis Carolinae

First, we provide an introduction to the theory and algorithms for noncommutative Gröbner bases for ideals in free associative algebras. Second, we explain how to construct universal associative envelopes for nonassociative structures defined by multilinear operations. Third, we extend the work of Elgendy (2012) for nonassociative structures on the 2-dimensional simple associative triple system to the 4- and 6-dimensional systems.

Homogeneous self dual cones versus Jordan algebras. The theory revisited

Jean Bellissard, B. Iochum (1978)

Annales de l'institut Fourier

Let 𝔐 be a Jordan-Banach algebra with identity 1, whose norm satisfies:(i) a b a b ,    a , b 𝔐 (ii) a 2 = a 2 (iii) a 2 a 2 + b 2 . 𝔐 is called a JB algebra (E.M. Alfsen, F.W. Shultz and E. Stormer, Oslo preprint (1976)). The set 𝔐 + of squares in 𝔐 is a closed convex cone. ( 𝔐 , 𝔐 + , 1 ) is a complete ordered vector space with 1 as a order unit. In addition, we assume 𝔐 to be monotone complete (i.e. 𝔐 coincides with the bidual 𝔐 * * ), and that there exists a finite normal faithful trace φ on 𝔐 .Then the completion { 𝔐 + } φ of 𝔐 + with respect to the Hilbert structure...

Inference for random effects in prime basis factorials using commutative Jordan algebras

Vera M. Jesus, Paulo Canas Rodrigues, João Tiago Mexia (2007)

Discussiones Mathematicae Probability and Statistics

Commutative Jordan algebras are used to drive an highly tractable framework for balanced factorial designs with a prime number p of levels for their factors. Both fixed effects and random effects models are treated. Sufficient complete statistics are obtained and used to derive UMVUE for the relevant parameters. Confidence regions are obtained and it is shown how to use duality for hypothesis testing.

New complexity analysis of a full Nesterov- Todd step infeasible interior-point algorithm for symmetric optimization

Behrouz Kheirfam, Nezam Mahdavi-Amiri (2013)


A full Nesterov-Todd step infeasible interior-point algorithm is proposed for solving linear programming problems over symmetric cones by using the Euclidean Jordan algebra. Using a new approach, we also provide a search direction and show that the iteration bound coincides with the best known bound for infeasible interior-point methods.

Currently displaying 1 – 20 of 60

Page 1 Next