Results 211 to 220 of about 10,446 (263)

Facile Fabrication of Attapulgite-Modified Chitosan Composite Aerogels with Enhanced Mechanical Strength and Flame Retardancy for Thermal Insulation. [PDF]

Polymers (Basel)
Cheng S, Shao Y, Chen M, Wang C, Zhu X, Zhang X, Fu B.   +6 more
europepmc   +1 more source

Interface Topology Driven Loss Minimization in Integrated Photonics: THz Ultrahigh-Q Cavities and Waveguides. [PDF]

Adv Mater
Shen Z, Tan YJ, Wang W, Tan TC, Yan R, Zhang L, Singh R.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Extension of primal-dual interior point algorithms to symmetric cones

Mathematical Programming, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schmieta, S. H., Alizadeh, F.
openaire   +2 more sources

Analysis of a non-interior continuation method for second-order cone programming

Journal of Applied Mathematics and Computing, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chi, Xiaoni, Liu, Sanyang
openaire   +2 more sources

QUASI-INTERIOR POINTS OF CONES

1963
Abstract : A point is not equal to theta belonging to a convex cone K with vertex theta in a locally convex linear topological space X is called a quasi interior point (QI-point) of K if the linear extension of the set K intersection (x-K) is dense in X. The set K sub q of all quasi-interior points of K is called the quasi-interior of K.
C. C. Braunschweiger, R. E. Fullerton
openaire   +1 more source

Non-interior continuation algorithm for solving system of inequalities over symmetric cones

Transactions of Tianjin University, 2011
As a basic mathematical structure, the system of inequalities over symmetric cones and its solution can provide an effective method for solving the startup problem of interior point method which is used to solve many optimization problems. In this paper, a non-interior continuation algorithm is proposed for solving the system of inequalities under the ...
Ying Zhang, Nan Lu
openaire   +1 more source

A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming

SIAM Journal on Optimization, 2008
We propose a class of interior proximal-like algorithms for the second-order cone program, which is to minimize a closed proper convex function subject to general second-order cone constraints. The class of methods uses a distance measure generated by a twice continuously differentiable strictly convex function on $(0,+\infty)$, and includes as a ...
Shaohua Pan, Jein-Shan Chen
openaire   +1 more source