نتایج جستجو برای: circular cone programming

تعداد نتایج: 434794  

Journal: :Optics express 2008
Zhibing Ge Ruibo Lu Thomas X Wu Shin-Tson Wu Chao-Lien Lin Nai-Chin Hsu Wang-Yang Li Chung-Kuang Wei

A new broadband wide-view circular polarizer is proposed for high transmittance multi-domain vertical-alignment liquid crystal displays (MVA LCDs). This configuration only requires one biaxial plate in the conventional circular polarizer. The optimal film parameters are obtained analytically through spherical trigonometric method on the Poincaré sphere and through computer-aided parameter searc...

Journal: :Math. Oper. Res. 2014
Boris S. Mordukhovich T. T. A. Nghia

The paper is devoted to the study of general nonsmooth problems of cone-constrained optimization (or conic programming) important for various aspects of optimization theory and applications. Based on advanced constructions and techniques of variational analysis and generalized differentiation, we derive new necessary optimality conditions (in both " exact " and " fuzzy " forms) for nonsmooth co...

2000
Sunyoung Kim Masakazu Kojima

A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or combinatorial optimization problems lies in its expensive computational cost. This paper proposes a SOCP (second-order-cone programming) relaxation method, which strengthens the lift-and-project LP (linear programming) relaxation method by adding convex quadratic valid inequalities for the positive semid...

2016
Xiaoni Chi Hongjin Wei Yuqiang Feng Jiawei Chen

In this paper, we study the circular cone eigenvalue complementarity problem (CCEiCP) by variational inequality technique, prove the existence of a solution to CCEiCP, and investigate different nonlinear programming formulations of the symmetric and asymmetric CCEiCP, respectively. We reduce CCEiCP to a variational inequality problem on a compact convex set, which guarantees that CCEiCP has at ...

Journal: :Journal of Optimization Theory and Applications 2022

In Andreani et al. (Weak notions of nondegeneracy in nonlinear semidefinite programming, 2020), the classical notion (or transversality) and Robinson’s constraint qualification have been revisited context programming exploiting structure problem, namely its eigendecomposition. This allows formulating conditions equivalently terms (positive) linear independence significantly smaller sets vectors...

2017
Evelina Ametova Massimiliano Ferrucci Wim Dewulf

Abstract Cone-beam computed tomography (CT) with circular scanning trajectory is known to suffer from so called cone-beam artifacts. Cone-beam artifacts are errors in the reconstructed volume due to incomplete radon data. These artifacts increase with increasing distance of the reconstructed plane from the midplane, i.e. the plane containing the X-ray source. Theoretically, the midplane represe...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید