東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Non-Convex Optimization and Applicat...

Gronski, Jessica.

FindBook

Google Book

Amazon

博客來

Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging./
作者:	Gronski, Jessica.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2019,
面頁冊數:	143 p.
附註:	Source: Dissertations Abstracts International, Volume: 80-12, Section: B.
Contained By:	Dissertations Abstracts International80-12B.
標題:	Applied Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13856806
ISBN:	9781392164914

Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.
Gronski, Jessica.

Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging. - Ann Arbor : ProQuest Dissertations & Theses, 2019 - 143 p.

Source: Dissertations Abstracts International, Volume: 80-12, Section: B.

Thesis (Ph.D.)--University of Colorado at Boulder, 2019.

This item must not be sold to any third party vendors.

Bilinear programs and Phase Retrieval are two instances of nonconvex problems that arise in engineering and physical applications, and both occur with their fundamental difficulties. In this thesis, we consider various methods and algorithms for tackling these challenging problems and discuss their effectiveness.Bilinear programs (BLPs) are ubiquitous in engineering applications, economics, and operations research, and have a natural encoding to quadratic programs. They appear in the study of Lyapunov functions used to deduce the stability of solutions to differential equations describing dynamical systems. For multivariate dynamical systems, the problem formulation for computing an appropriate Lyapunov function is a BLP. In electric power systems engineering, one of the most practically important and well-researched subfields of constrained nonlinear optimization is Optimal Power Flow wherein one attempts to optimize an electric power system subject to physical constraints imposed by electrical laws and engineering limits, which can be naturally formulated as a quadratic program. In a recent publication, we studied the relationship between data flow constraints for numerical domains such as polyhedra and bilinear constraints.The problem of recovering an image from its Fourier modulus, or intensity, measurements emerges in many physical and engineering applications. The problem is known as Fourier phase retrieval wherein one attempts to recover the phase information of a signal in order to accurately reconstruct it from estimated intensity measurements by applying the inverse Fourier transform. The problem of recovering phase information from a set of measurements can be formulated as a quadratic program. This problem is well-studied but still presents many challenges. The resolution of an optical device is defined as the smallest distance between two objects such that the two objects can still be recognized as separate entities. Due to the physics of diffraction, and the way that light bends around an obstacle, the resolving power of an optical system is limited. This limit, known as the diffraction limit, was first introduced by Ernst Abbe in 1873. Obtaining the complete phase information would enable one to perfectly reconstruct an image; however, the problem is severely ill-posed and the leads to a specialized type of quadratic program, known as super-resolution imaging, wherein one attempts to learn phase information beyond the limits of diffraction and the limitations imposed by the imaging device.

ISBN: 9781392164914Subjects--Topical Terms:

1669109
Applied Mathematics.

Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.
LDR:03669nmm a2200337 4500 001 2263400
005 20200316072002.5
008 220629s2019 ||||||||||||||||| ||eng d
020 $a 9781392164914
035 $a (MiAaPQ)AAI13856806
035 $a (MiAaPQ)colorado:15912
035 $a AAI13856806
040 $a MiAaPQ $c MiAaPQ
100 1 $a Gronski, Jessica. $3 3540492
245 1 0 $a Non-Convex Optimization and Applications to Bilinear Programming and Super-Resolution Imaging.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2019
300 $a 143 p.
500 $a Source: Dissertations Abstracts International, Volume: 80-12, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Becker, Stephen.
502 $a Thesis (Ph.D.)--University of Colorado at Boulder, 2019.
506 $a This item must not be sold to any third party vendors.
520 $a Bilinear programs and Phase Retrieval are two instances of nonconvex problems that arise in engineering and physical applications, and both occur with their fundamental difficulties. In this thesis, we consider various methods and algorithms for tackling these challenging problems and discuss their effectiveness.Bilinear programs (BLPs) are ubiquitous in engineering applications, economics, and operations research, and have a natural encoding to quadratic programs. They appear in the study of Lyapunov functions used to deduce the stability of solutions to differential equations describing dynamical systems. For multivariate dynamical systems, the problem formulation for computing an appropriate Lyapunov function is a BLP. In electric power systems engineering, one of the most practically important and well-researched subfields of constrained nonlinear optimization is Optimal Power Flow wherein one attempts to optimize an electric power system subject to physical constraints imposed by electrical laws and engineering limits, which can be naturally formulated as a quadratic program. In a recent publication, we studied the relationship between data flow constraints for numerical domains such as polyhedra and bilinear constraints.The problem of recovering an image from its Fourier modulus, or intensity, measurements emerges in many physical and engineering applications. The problem is known as Fourier phase retrieval wherein one attempts to recover the phase information of a signal in order to accurately reconstruct it from estimated intensity measurements by applying the inverse Fourier transform. The problem of recovering phase information from a set of measurements can be formulated as a quadratic program. This problem is well-studied but still presents many challenges. The resolution of an optical device is defined as the smallest distance between two objects such that the two objects can still be recognized as separate entities. Due to the physics of diffraction, and the way that light bends around an obstacle, the resolving power of an optical system is limited. This limit, known as the diffraction limit, was first introduced by Ernst Abbe in 1873. Obtaining the complete phase information would enable one to perfectly reconstruct an image; however, the problem is severely ill-posed and the leads to a specialized type of quadratic program, known as super-resolution imaging, wherein one attempts to learn phase information beyond the limits of diffraction and the limitations imposed by the imaging device.
590 $a School code: 0051.
650 4 $a Applied Mathematics. $3 1669109
650 4 $a Optics. $3 517925
650 4 $a Computer science. $3 523869
690 $a 0364
690 $a 0752
690 $a 0984
710 2 $a University of Colorado at Boulder. $b Applied Mathematics. $3 1030307
773 0 $t Dissertations Abstracts International $g 80-12B.
790 $a 0051
791 $a Ph.D.
792 $a 2019
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13856806