In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

a famous theorem of schur states that for a group $g$ finiteness of $g/z(g)$‎ ‎implies the finiteness of $g'.$ the converse of schur's theorem is an interesting problem which has been considered by some‎ ‎authors‎. ‎recently‎, ‎podoski and szegedy proved the truth of the converse of schur's theorem for capable groups‎. ‎they also established an explicit bound for the index of the center of such...

Yukawa interactions of neutrinos with a new light scalar boson $\phi$ can lead to formation stable bound states and systems many ($\nu$-clusters). For allowed values the coupling $y$ mass $m_\phi$, state two would have size larger than $10^{12}$ cm. Bound sub-cm sizes are possible for keV scale sterile $y > 10^{-4}$. $\nu$-clusters we study in detail properties final configurations. If there is...

nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

stability of foundations near slopes is one of the important and complicated problems in geotechnical engineering, which has been investigated by various methods such as limit equilibrium, limit analysis, slip-line, finite element and discrete element. the complexity of this problem is resulted from the combination of two probable failures: foundation failure and overall slope failure. the curr...

thanks to the development of the concept of metadiscourse, it is now widely acknowledged that academic/scientific writing is not only concerned with communicating purely propositional meanings: what is communicated through academic/scientific communication is seen to be intertwined with the negotiation of social and interpersonal meanings. while a large number of so called metadiscoursal resour...

One of the major disadvantages of using Branch and Bound algorithm to solve permutation bases problems by computer is the size of main memory required. The single Array Branch and Bound (SABB) method introduction here aims to overcome this deficiency, using only N memory locations as a vector of size N, and a single cell C with N bits.