CITY UNIVERSITY OF HONG KONG
|
|
- Juniper Bennett
- 5 years ago
- Views:
Transcription
1 CITY UNIVERSITY OF HONG KONG Topics in Optimization: Solving Second-Order Conic Systems with Finite Precision; Calculus of Generalized Subdifferentials for Nonsmooth Functions Submitted to Department of Mathematics in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy by Vera Roshchina June 2009
2 Abstract This work consists of three parts. The first one is devoted to the work done jointly with my supervisor Prof. Felipe Cucker from the City University of Hong Kong and Prof. Javier Peña from the Carnegie-Mellon University on the finite-precision analysis of an interior-point method for solving second-order conic systems. The second part concerns results related to calculus of exhausters, which were obtained jointly or with advice of Prof. Vladimir Fedorovich Demyanov from St.-Petersburg State University. The third chapter is devoted to the calculus of generalized differentials and contains authors s original results on this subject. In Chapter 1, an interior-point method to decide feasibility problems of secondorder conic systems is described and analyzed. A main feature of this algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of arithmetic operations and the finest precision required are exhibited. This work has given rise to publication [21]. Chapter 2 is devoted to the study of exhausters and some related problems. In Section 2.2 we introduce the notions of upper and lower exhausters and give some historic background, then in Sections 2.3 and 2.4 we discuss optimality conditions in terms of exhausters. The optimality conditions in terms of proper exhausters were stated by Demyanov [23], and the optimality conditions in terms of adjoint exhausters were obtained by Roshchina in [105]. In Section 2.5 we address the problem of constructing exhausters, and show how to construct an exhauster of an arbitrary locally Lipschitz function. This was originally published by Roshchina in [100]. Section 2.6 is based on the work [103] and devoted to the problem of minimality of exhausters. In Sections 2.7 and i
3 2.8 the problems of reducing exhausters and converting lower exhausters to upper ones and vice versa are discussed. These two sections are based on the work [104]. In Chapter 3 relationships between exhausters and generalized subdifferentials are discussed. In Section 3.2 we introduce the relationship between exhausters, Fréchet and Gâteaux subdifferentials and provide some calculus rules based on this relationship. In Section 3.3 we study the relationships between exhausters and the Mordukhovich subdifferential, following the lines of [101]. Section 3.4 is devoted to a study of Mordukhovich subdifferential of a minimum of approximate convex functions. This study was motivated by the results obtained in calculus of exhausters, and is based on [102]. The thesis has two appendices. Appendix A contains some technical details for the finite-precision analysis of Chapter 1, and Appendix B contains some classical facts from Nonsmooth Analysis. ii
4 Contents Abstract i Certification of approval by the Panel of Examiners iii Acknowledgements iv Contents v List of figures x Abbreviations xii Notations xiii 1 Solving SOC systems with finite precision Introduction Second-order conic programming (SOCP) Examples and applications of SOCP Euclidean Jordan algebras on second-order cones Interior-point methods Software for solving SOCP Finite-precision analysis and other computational issues The Problem and The Main Result Basic objects and notations Main Ideas v
5 1.3.1 Reformulation The algorithm On the update of ( x; y; s) The stepping stones Proof of Theorem Preliminaries Second-order cones Second-order cones and Jordan algebras Barrier functions Local norms Some useful lemmas Floating-point arithmetic Proofs of Propositions and Proof of Proposition Proof of Proposition Proof of Lemma Proofs of Propositions and Proof of Proposition Proof of Proposition Proof of Lemma Proof of Proposition Proof of Step Proof of Step Proof of Step Proof of Step Exhausters and related problems Introduction Families of upper and lower approximations. Exhausters vi
6 2.3 Unconstrained Optimality Conditions in Terms of Exhausters Unconstrained Optimality Conditions in Terms of Proper Exhausters Unconstrained Optimality Conditions in Terms of Adjoint Exhausters Examples Constrained Optimality Conditions in Terms of Exhausters Constrained Optimality Conditions in Terms of Proper Exhausters Constrained Optimality Conditions in Terms of Adjoint Exhausters Examples Constructing Exhausters Minimality of Exhausters Introduction Definitions of minimality Necessary conditions for the minimality of exhausters Sufficient conditions for the set minimality of exhausters Reducing Exhausters Reduction of exhauster by alteration of shape of the sets Reduction of exhauster by removing abundant sets Convertors Simple convertors Advanced convertors Calculus of generalized subdifferentials Introduction Exact Calculus Rules for the Fréchet Subdifferential vii
7 3.2.1 Relationship between the Fréchet and Gâteaux subdifferential and exhausters Exact calculus rules for the Fréchet subdifferential of Hadamard directionally differentiable functions Examples General conclusion concerning Section Relationship between the Mordukhovich subdifferential and exhausters Set convergence and the definition of the Mordukhovich subdifferential Mordukhovich subdifferential and upper exhausters Example Mordukhovich subdifferential of pointwise minimum of approximate convex functions Introduction Proof of Theorem Examples Index 167 Bibliography 170 A Technical details for Chapter A.1 Proofs of useful lemmas A.1.1 Proof of Lemma A.1.2 Proof of Lemma A.1.3 Proof of Lemma A.1.4 Proof of Lemma A.1.5 Proof of Lemma A.1.6 Proof of Lemma viii
8 A.2 Proof of Lemma B Some basic facts from Nonsmooth Analysis 205 B.1 Convex Analysis B.1.1 Convex Sets B.1.2 Convex Functions and the subdifferential B.1.3 Sublinearity and support functions B.2 Lipschitz continuity B.3 Directional derivatives and optimality conditions B.4 Quasidifferentiability ix
9 List of Figures 2.1 An upper exhauster that is not minimal, but satisfies a necessary condition for the minimality (Example 5) Difference between M (C) and M (C) An upper exhauster that satisfies the set-minimality, but is not minimal (Example 7) Geometrical construction of Q (C, g 0 ) and B (C, g 0 ) (Examples 8-9) Reducing an upper exhauster (Example 12) Using convertors and modified convertors to obtain a lower exhauster from an upper one (Example 13) An upper exhauster and the Fréchet subdifferential (Example 14) An upper exhauster and the Fréchet subdifferential (Example 15) Constructing an exhauster of f (Example 17) Evaluating the Fréchet subdifferential via an upper exhauster (Example 18) Obtaining the Fréchet and the Mordukhovich subdifferentials via exhausters (Example 19) Mordukhovich subdifferential of the minimum of strictly differentiable functions (Example 20) Mordukhovich subdifferential of the minimum of two convex functions (Example 21) x
10 3.8 Failure of Theorem to hold without the approximate convexity assumption (Example 23) xi
11 Abbreviations D.-d.d. Dini directionally differentiable H.-d.d. Hadamard directionally differentiable IPM interior point method l.c.a. lower concave approximation L.E.F. exhaustive family of lower concave approximations (l.c.a s) LP linear programming NT Nesterov-Todd (algorithm or direction) p.h. positively homogeneous QCQP convex quadratically constrained quadratic programming QP quadratic programming SDP semidefinite programming SOCP second-order cone programming u.c.a. upper convex approximation U.E.F. exhaustive family of upper convex approximations (u.c.a s) xii
12 Notations IN The set of natural numbers IR The set of real numbers IR n Real vector space (n-dimensional) IB The unit ball in the space under consideration S The unit sphere in the space under consideration S n The unit sphere in IR n cl Closure of a set in IR n co Convex hull of a set in IR n int Interior of a set in IR n Depending on the context, denotes either the boundary of a set or a subdifferential C, C Subdifferential in the sense of Convex Analysis + C Superdifferential (of a concave function) in the sense of Convex Analysis Cl Clarke subdifferential F, F Fréchet (lower) subdifferential + F Fréchet upper subdifferential G, G Gâteaux (lower) subdifferential xiii
13 xiv + G Gâteaux upper subdifferential M Mordukhovich subdifferential, Demyanov-Rubinov sub- and superdifferentials, The scalar product given by a, b = a T b = n i=1 a ib i for every a, b in IR n Euclidean norm (2-norm) given by x = x, x For vectors x, y and z the following are synonymous x y z = (xt, y T, z T ) T = (x; y; z). For any a, b IR, a b by (a, b) and [a, b] we denote the open and the closed intervals respectively with endpoints in a and b. By {x k } or {x k } 1 we denote a sequence of points in the space under consideration indexed by the set of natural numbers. By t k t we mean that a sequence of real numbers {t k } converges to t, and t k > t for every k in IN.
Relationships between upper exhausters and the basic subdifferential in variational analysis
J. Math. Anal. Appl. 334 (2007) 261 272 www.elsevier.com/locate/jmaa Relationships between upper exhausters and the basic subdifferential in variational analysis Vera Roshchina City University of Hong
More informationSOME REMARKS ON THE SPACE OF DIFFERENCES OF SUBLINEAR FUNCTIONS
APPLICATIONES MATHEMATICAE 22,3 (1994), pp. 419 426 S. G. BARTELS and D. PALLASCHKE (Karlsruhe) SOME REMARKS ON THE SPACE OF DIFFERENCES OF SUBLINEAR FUNCTIONS Abstract. Two properties concerning the space
More informationConvex Optimization M2
Convex Optimization M2 Lecture 3 A. d Aspremont. Convex Optimization M2. 1/49 Duality A. d Aspremont. Convex Optimization M2. 2/49 DMs DM par email: dm.daspremont@gmail.com A. d Aspremont. Convex Optimization
More informationLecture: Duality of LP, SOCP and SDP
1/33 Lecture: Duality of LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2017.html wenzw@pku.edu.cn Acknowledgement:
More information12. Interior-point methods
12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
More informationON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION
ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION CHRISTIAN GÜNTHER AND CHRISTIANE TAMMER Abstract. In this paper, we consider multi-objective optimization problems involving not necessarily
More informationConvex Optimization and Modeling
Convex Optimization and Modeling Convex Optimization Fourth lecture, 05.05.2010 Jun.-Prof. Matthias Hein Reminder from last time Convex functions: first-order condition: f(y) f(x) + f x,y x, second-order
More informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationarxiv: v1 [math.oc] 17 Oct 2017
Noname manuscript No. (will be inserted by the editor) Saddle representations of positively homogeneous functions by linear functions Valentin V. Gorokhovik Marina Trafimovich arxiv:1710.06133v1 [math.oc]
More informationOptimality Conditions for Nonsmooth Convex Optimization
Optimality Conditions for Nonsmooth Convex Optimization Sangkyun Lee Oct 22, 2014 Let us consider a convex function f : R n R, where R is the extended real field, R := R {, + }, which is proper (f never
More informationLecture: Duality.
Lecture: Duality http://bicmr.pku.edu.cn/~wenzw/opt-2016-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghe s lecture notes Introduction 2/35 Lagrange dual problem weak and strong
More informationII KLUWER ACADEMIC PUBLISHERS. Abstract Convexity and Global Optimization. Alexander Rubinov
Abstract Convexity and Global Optimization by Alexander Rubinov School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria, Australia II KLUWER ACADEMIC PUBLISHERS DORDRECHT
More informationConvex Optimization. (EE227A: UC Berkeley) Lecture 6. Suvrit Sra. (Conic optimization) 07 Feb, 2013
Convex Optimization (EE227A: UC Berkeley) Lecture 6 (Conic optimization) 07 Feb, 2013 Suvrit Sra Organizational Info Quiz coming up on 19th Feb. Project teams by 19th Feb Good if you can mix your research
More informationPrimal-Dual Symmetric Interior-Point Methods from SDP to Hyperbolic Cone Programming and Beyond
Primal-Dual Symmetric Interior-Point Methods from SDP to Hyperbolic Cone Programming and Beyond Tor Myklebust Levent Tunçel September 26, 2014 Convex Optimization in Conic Form (P) inf c, x A(x) = b, x
More informationOptimality, identifiability, and sensitivity
Noname manuscript No. (will be inserted by the editor) Optimality, identifiability, and sensitivity D. Drusvyatskiy A. S. Lewis Received: date / Accepted: date Abstract Around a solution of an optimization
More informationInterior Point Methods: Second-Order Cone Programming and Semidefinite Programming
School of Mathematics T H E U N I V E R S I T Y O H F E D I N B U R G Interior Point Methods: Second-Order Cone Programming and Semidefinite Programming Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio
More information5. Duality. Lagrangian
5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized
More informationA PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE
Yugoslav Journal of Operations Research 24 (2014) Number 1, 35-51 DOI: 10.2298/YJOR120904016K A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE BEHROUZ
More informationLecture 6: Conic Optimization September 8
IE 598: Big Data Optimization Fall 2016 Lecture 6: Conic Optimization September 8 Lecturer: Niao He Scriber: Juan Xu Overview In this lecture, we finish up our previous discussion on optimality conditions
More information4. Convex optimization problems
Convex Optimization Boyd & Vandenberghe 4. Convex optimization problems optimization problem in standard form convex optimization problems quasiconvex optimization linear optimization quadratic optimization
More informationLecture: Convex Optimization Problems
1/36 Lecture: Convex Optimization Problems http://bicmr.pku.edu.cn/~wenzw/opt-2015-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghe s lecture notes Introduction 2/36 optimization
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationSecond-order cone programming
Outline Second-order cone programming, PhD Lehigh University Department of Industrial and Systems Engineering February 10, 2009 Outline 1 Basic properties Spectral decomposition The cone of squares The
More informationCONTENTS. Preface Preliminaries 1
Preface xi Preliminaries 1 1 TOOLS FOR ANALYSIS 5 1.1 The Completeness Axiom and Some of Its Consequences 5 1.2 The Distribution of the Integers and the Rational Numbers 12 1.3 Inequalities and Identities
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
More informationWhat can be expressed via Conic Quadratic and Semidefinite Programming?
What can be expressed via Conic Quadratic and Semidefinite Programming? A. Nemirovski Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Abstract Tremendous recent
More informationUsing Schur Complement Theorem to prove convexity of some SOC-functions
Journal of Nonlinear and Convex Analysis, vol. 13, no. 3, pp. 41-431, 01 Using Schur Complement Theorem to prove convexity of some SOC-functions Jein-Shan Chen 1 Department of Mathematics National Taiwan
More informationThe Directed Subdifferential of DC Functions
Contemporary Mathematics The Directed Subdifferential of DC Functions Robert Baier and Elza Farkhi Dedicated to Alexander Ioffe and Simeon Reich on their 7th resp. 6th birthdays. Abstract. The space of
More informationStructural and Multidisciplinary Optimization. P. Duysinx and P. Tossings
Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be
More informationMathematics for Economics and Finance
Mathematics for Economics and Finance Michael Harrison and Patrick Waldron B 375482 Routledge Taylor & Francis Croup LONDON AND NEW YORK Contents List of figures ix List of tables xi Foreword xiii Preface
More informationLecture: Examples of LP, SOCP and SDP
1/34 Lecture: Examples of LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html wenzw@pku.edu.cn Acknowledgement:
More informationOuter limits of subdifferentials for min-max type functions
Outer limits of subdifferentials for min-max type functions Andrew Eberhard, Vera Roshchina, Tian Sang August 31, 2017 arxiv:1701.02852v2 [math.oc] 30 Aug 2017 Abstract We generalise the outer subdifferential
More informationConvex optimization problems. Optimization problem in standard form
Convex optimization problems optimization problem in standard form convex optimization problems linear optimization quadratic optimization geometric programming quasiconvex optimization generalized inequality
More informationApplications of Mathematics
Applications of Mathematics Ivan Ginchev; Angelo Guerraggio; Matteo Rocca From scalar to vector optimization Applications of Mathematics, Vol. 51 (2006), No. 1, 5--36 Persistent URL: http://dml.cz/dmlcz/134627
More informationLECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE
LECTURE 25: REVIEW/EPILOGUE LECTURE OUTLINE CONVEX ANALYSIS AND DUALITY Basic concepts of convex analysis Basic concepts of convex optimization Geometric duality framework - MC/MC Constrained optimization
More informationl p -Norm Constrained Quadratic Programming: Conic Approximation Methods
OUTLINE l p -Norm Constrained Quadratic Programming: Conic Approximation Methods Wenxun Xing Department of Mathematical Sciences Tsinghua University, Beijing Email: wxing@math.tsinghua.edu.cn OUTLINE OUTLINE
More information12. Interior-point methods
12. Interior-point methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
More informationLagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)
Lagrange Duality Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Lagrangian Dual function Dual
More informationAcyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs
2015 American Control Conference Palmer House Hilton July 1-3, 2015. Chicago, IL, USA Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Raphael Louca and Eilyan Bitar
More informationConvex Optimization Boyd & Vandenberghe. 5. Duality
5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized
More informationL. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones. definition. spectral decomposition. quadratic representation. log-det barrier 18-1
L. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones definition spectral decomposition quadratic representation log-det barrier 18-1 Introduction This lecture: theoretical properties of the following
More informationSemidefinite Programming
Semidefinite Programming Notes by Bernd Sturmfels for the lecture on June 26, 208, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra The transition from linear algebra to nonlinear algebra has
More information15. Conic optimization
L. Vandenberghe EE236C (Spring 216) 15. Conic optimization conic linear program examples modeling duality 15-1 Generalized (conic) inequalities Conic inequality: a constraint x K where K is a convex cone
More informationConvex Optimization Problems. Prof. Daniel P. Palomar
Conve Optimization Problems Prof. Daniel P. Palomar The Hong Kong University of Science and Technology (HKUST) MAFS6010R- Portfolio Optimization with R MSc in Financial Mathematics Fall 2018-19, HKUST,
More informationIntroduction to Functional Analysis With Applications
Introduction to Functional Analysis With Applications A.H. Siddiqi Khalil Ahmad P. Manchanda Tunbridge Wells, UK Anamaya Publishers New Delhi Contents Preface vii List of Symbols.: ' - ix 1. Normed and
More informationGlobal Maximum of a Convex Function: Necessary and Sufficient Conditions
Journal of Convex Analysis Volume 13 2006), No. 3+4, 687 694 Global Maximum of a Convex Function: Necessary and Sufficient Conditions Emil Ernst Laboratoire de Modélisation en Mécaniue et Thermodynamiue,
More informationConic Linear Programming. Yinyu Ye
Conic Linear Programming Yinyu Ye December 2004, revised October 2017 i ii Preface This monograph is developed for MS&E 314, Conic Linear Programming, which I am teaching at Stanford. Information, lecture
More informationSome preconditioners for systems of linear inequalities
Some preconditioners for systems of linear inequalities Javier Peña Vera oshchina Negar Soheili June 0, 03 Abstract We show that a combination of two simple preprocessing steps would generally improve
More informationOn duality gap in linear conic problems
On duality gap in linear conic problems C. Zălinescu Abstract In their paper Duality of linear conic problems A. Shapiro and A. Nemirovski considered two possible properties (A) and (B) for dual linear
More informationContents. 2 Sequences and Series Approximation by Rational Numbers Sequences Basics on Sequences...
Contents 1 Real Numbers: The Basics... 1 1.1 Notation... 1 1.2 Natural Numbers... 4 1.3 Integers... 5 1.4 Fractions and Rational Numbers... 10 1.4.1 Introduction... 10 1.4.2 Powers and Radicals of Rational
More informationOn Nonconvex Subdifferential Calculus in Banach Spaces 1
Journal of Convex Analysis Volume 2 (1995), No.1/2, 211 227 On Nonconvex Subdifferential Calculus in Banach Spaces 1 Boris S. Mordukhovich, Yongheng Shao Department of Mathematics, Wayne State University,
More informationIn Progress: Summary of Notation and Basic Results Convex Analysis C&O 663, Fall 2009
In Progress: Summary of Notation and Basic Results Convex Analysis C&O 663, Fall 2009 Intructor: Henry Wolkowicz November 26, 2009 University of Waterloo Department of Combinatorics & Optimization Abstract
More informationChapter 2: Preliminaries and elements of convex analysis
Chapter 2: Preliminaries and elements of convex analysis Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-14-15.shtml Academic year 2014-15
More informationGENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION
Chapter 4 GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION Alberto Cambini Department of Statistics and Applied Mathematics University of Pisa, Via Cosmo Ridolfi 10 56124
More informationConvex sets, conic matrix factorizations and conic rank lower bounds
Convex sets, conic matrix factorizations and conic rank lower bounds Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute
More informationConvex Optimization and l 1 -minimization
Convex Optimization and l 1 -minimization Sangwoon Yun Computational Sciences Korea Institute for Advanced Study December 11, 2009 2009 NIMS Thematic Winter School Outline I. Convex Optimization II. l
More informationSEMIDEFINITE PROGRAM BASICS. Contents
SEMIDEFINITE PROGRAM BASICS BRIAN AXELROD Abstract. A introduction to the basics of Semidefinite programs. Contents 1. Definitions and Preliminaries 1 1.1. Linear Algebra 1 1.2. Convex Analysis (on R n
More informationThe boundedness of the Riesz transform on a metric cone
The boundedness of the Riesz transform on a metric cone Peijie Lin September 2012 A thesis submitted for the degree of Doctor of Philosophy of the Australian National University Declaration The work in
More informationI.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010
I.3. LMI DUALITY Didier HENRION henrion@laas.fr EECI Graduate School on Control Supélec - Spring 2010 Primal and dual For primal problem p = inf x g 0 (x) s.t. g i (x) 0 define Lagrangian L(x, z) = g 0
More informationDepartment of Social Systems and Management. Discussion Paper Series
Department of Social Systems and Management Discussion Paper Series No. 1262 Complementarity Problems over Symmetric Cones: A Survey of Recent Developments in Several Aspects by Akiko YOSHISE July 2010
More informationLargest dual ellipsoids inscribed in dual cones
Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that
More informationLecture 17: Primal-dual interior-point methods part II
10-725/36-725: Convex Optimization Spring 2015 Lecture 17: Primal-dual interior-point methods part II Lecturer: Javier Pena Scribes: Pinchao Zhang, Wei Ma Note: LaTeX template courtesy of UC Berkeley EECS
More informationInterior-Point Methods for Linear Optimization
Interior-Point Methods for Linear Optimization Robert M. Freund and Jorge Vera March, 204 c 204 Robert M. Freund and Jorge Vera. All rights reserved. Linear Optimization with a Logarithmic Barrier Function
More informationLecture: Introduction to LP, SDP and SOCP
Lecture: Introduction to LP, SDP and SOCP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2015.html wenzw@pku.edu.cn Acknowledgement:
More informationThe Q-parametrization (Youla) Lecture 13: Synthesis by Convex Optimization. Lecture 13: Synthesis by Convex Optimization. Example: Spring-mass System
The Q-parametrization (Youla) Lecture 3: Synthesis by Convex Optimization controlled variables z Plant distubances w Example: Spring-mass system measurements y Controller control inputs u Idea for lecture
More informationSensitivity Analysis for Nonsmooth Dynamic Systems. Kamil Ahmad Khan
Sensitivity Analysis for Nonsmooth Dynamic Systems by Kamil Ahmad Khan B.S.E., Chemical Engineering, Princeton University (2009) M.S. Chemical Engineering Practice, Massachusetts Institute of Technology
More informationA Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems
A Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems Xiaoni Chi Guilin University of Electronic Technology School of Math & Comput Science Guilin Guangxi 541004 CHINA chixiaoni@126.com
More informationPreprint February 19, 2018 (1st version October 31, 2017) Pareto efficient solutions in multi-objective optimization involving forbidden regions 1
Preprint February 19, 2018 1st version October 31, 2017) Pareto efficient solutions in multi-objective optimization involving forbidden regions 1 by CHRISTIAN GÜNTHER Martin Luther University Halle-Wittenberg
More informationChapter 2 Convex Analysis
Chapter 2 Convex Analysis The theory of nonsmooth analysis is based on convex analysis. Thus, we start this chapter by giving basic concepts and results of convexity (for further readings see also [202,
More informationTranslative Sets and Functions and their Applications to Risk Measure Theory and Nonlinear Separation
Translative Sets and Functions and their Applications to Risk Measure Theory and Nonlinear Separation Andreas H. Hamel Abstract Recently defined concepts such as nonlinear separation functionals due to
More informationContents. Set Theory. Functions and its Applications CHAPTER 1 CHAPTER 2. Preface... (v)
(vii) Preface... (v) CHAPTER 1 Set Theory Definition of Set... 1 Roster, Tabular or Enumeration Form... 1 Set builder Form... 2 Union of Set... 5 Intersection of Sets... 9 Distributive Laws of Unions and
More informationGEORGIA INSTITUTE OF TECHNOLOGY H. MILTON STEWART SCHOOL OF INDUSTRIAL AND SYSTEMS ENGINEERING LECTURE NOTES OPTIMIZATION III
GEORGIA INSTITUTE OF TECHNOLOGY H. MILTON STEWART SCHOOL OF INDUSTRIAL AND SYSTEMS ENGINEERING LECTURE NOTES OPTIMIZATION III CONVEX ANALYSIS NONLINEAR PROGRAMMING THEORY NONLINEAR PROGRAMMING ALGORITHMS
More informationIMPLEMENTATION OF INTERIOR POINT METHODS
IMPLEMENTATION OF INTERIOR POINT METHODS IMPLEMENTATION OF INTERIOR POINT METHODS FOR SECOND ORDER CONIC OPTIMIZATION By Bixiang Wang, Ph.D. A Thesis Submitted to the School of Graduate Studies in Partial
More informationPrimal-Dual Geometry of Level Sets and their Explanatory Value of the Practical Performance of Interior-Point Methods for Conic Optimization
Primal-Dual Geometry of Level Sets and their Explanatory Value of the Practical Performance of Interior-Point Methods for Conic Optimization Robert M. Freund M.I.T. June, 2010 from papers in SIOPT, Mathematics
More informationSome Properties of the Augmented Lagrangian in Cone Constrained Optimization
MATHEMATICS OF OPERATIONS RESEARCH Vol. 29, No. 3, August 2004, pp. 479 491 issn 0364-765X eissn 1526-5471 04 2903 0479 informs doi 10.1287/moor.1040.0103 2004 INFORMS Some Properties of the Augmented
More informationFULL STABILITY IN FINITE-DIMENSIONAL OPTIMIZATION
FULL STABILITY IN FINITE-DIMENSIONAL OPTIMIZATION B. S. MORDUKHOVICH 1, T. T. A. NGHIA 2 and R. T. ROCKAFELLAR 3 Abstract. The paper is devoted to full stability of optimal solutions in general settings
More informationDO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO
QUESTION BOOKLET EECS 227A Fall 2009 Midterm Tuesday, Ocotober 20, 11:10-12:30pm DO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO You have 80 minutes to complete the midterm. The midterm consists
More informationMathematics Syllabus UNIT I ALGEBRA : 1. SETS, RELATIONS AND FUNCTIONS
Mathematics Syllabus UNIT I ALGEBRA : 1. SETS, RELATIONS AND FUNCTIONS (i) Sets and their Representations: Finite and Infinite sets; Empty set; Equal sets; Subsets; Power set; Universal set; Venn Diagrams;
More informationConvex Optimization for Signal Processing and Communications: From Fundamentals to Applications
Convex Optimization for Signal Processing and Communications: From Fundamentals to Applications Chong-Yung Chi Institute of Communications Engineering & Department of Electrical Engineering National Tsing
More informationABSTRACT ALGEBRA WITH APPLICATIONS
ABSTRACT ALGEBRA WITH APPLICATIONS IN TWO VOLUMES VOLUME I VECTOR SPACES AND GROUPS KARLHEINZ SPINDLER Darmstadt, Germany Marcel Dekker, Inc. New York Basel Hong Kong Contents f Volume I Preface v VECTOR
More informationEE 227A: Convex Optimization and Applications October 14, 2008
EE 227A: Convex Optimization and Applications October 14, 2008 Lecture 13: SDP Duality Lecturer: Laurent El Ghaoui Reading assignment: Chapter 5 of BV. 13.1 Direct approach 13.1.1 Primal problem Consider
More informationLecture 9 Sequential unconstrained minimization
S. Boyd EE364 Lecture 9 Sequential unconstrained minimization brief history of SUMT & IP methods logarithmic barrier function central path UMT & SUMT complexity analysis feasibility phase generalized inequalities
More informationFRTN10 Multivariable Control, Lecture 13. Course outline. The Q-parametrization (Youla) Example: Spring-mass System
FRTN Multivariable Control, Lecture 3 Anders Robertsson Automatic Control LTH, Lund University Course outline The Q-parametrization (Youla) L-L5 Purpose, models and loop-shaping by hand L6-L8 Limitations
More informationCourse Outline. FRTN10 Multivariable Control, Lecture 13. General idea for Lectures Lecture 13 Outline. Example 1 (Doyle Stein, 1979)
Course Outline FRTN Multivariable Control, Lecture Automatic Control LTH, 6 L-L Specifications, models and loop-shaping by hand L6-L8 Limitations on achievable performance L9-L Controller optimization:
More informationGEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect
GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, 2018 BORIS S. MORDUKHOVICH 1 and NGUYEN MAU NAM 2 Dedicated to Franco Giannessi and Diethard Pallaschke with great respect Abstract. In
More informationLINEAR AND NONLINEAR PROGRAMMING
LINEAR AND NONLINEAR PROGRAMMING Stephen G. Nash and Ariela Sofer George Mason University The McGraw-Hill Companies, Inc. New York St. Louis San Francisco Auckland Bogota Caracas Lisbon London Madrid Mexico
More informationLinear Topological Spaces
Linear Topological Spaces by J. L. KELLEY ISAAC NAMIOKA AND W. F. DONOGHUE, JR. G. BALEY PRICE KENNETH R. LUCAS WENDY ROBERTSON B. J. PETTIS W. R. SCOTT EBBE THUE POULSEN KENNAN T. SMITH D. VAN NOSTRAND
More informationCharacterizing Robust Solution Sets of Convex Programs under Data Uncertainty
Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty V. Jeyakumar, G. M. Lee and G. Li Communicated by Sándor Zoltán Németh Abstract This paper deals with convex optimization problems
More informationConstructing self-concordant barriers for convex cones
CORE DISCUSSION PAPER 2006/30 Constructing self-concordant barriers for convex cones Yu. Nesterov March 21, 2006 Abstract In this paper we develop a technique for constructing self-concordant barriers
More informationNecessary and Sufficient Conditions for the Existence of a Global Maximum for Convex Functions in Reflexive Banach Spaces
Laboratoire d Arithmétique, Calcul formel et d Optimisation UMR CNRS 6090 Necessary and Sufficient Conditions for the Existence of a Global Maximum for Convex Functions in Reflexive Banach Spaces Emil
More informationContents. 1 Preliminaries 3. Martingales
Table of Preface PART I THE FUNDAMENTAL PRINCIPLES page xv 1 Preliminaries 3 2 Martingales 9 2.1 Martingales and examples 9 2.2 Stopping times 12 2.3 The maximum inequality 13 2.4 Doob s inequality 14
More informationNew Perspectives. Functional Inequalities: and New Applications. Nassif Ghoussoub Amir Moradifam. Monographs. Surveys and
Mathematical Surveys and Monographs Volume 187 Functional Inequalities: New Perspectives and New Applications Nassif Ghoussoub Amir Moradifam American Mathematical Society Providence, Rhode Island Contents
More informationDouglas-Rachford splitting for nonconvex feasibility problems
Douglas-Rachford splitting for nonconvex feasibility problems Guoyin Li Ting Kei Pong Jan 3, 015 Abstract We adapt the Douglas-Rachford DR) splitting method to solve nonconvex feasibility problems by studying
More informationand C be the space of continuous and bounded real-valued functions endowed with the sup-norm 1.
1 Proof T : C C Let T be the following mapping: Tϕ = max {u (x, a)+βeϕ [f (x, a, ε)]} (1) a Γ(x) and C be the space of continuous and bounded real-valued functions endowed with the sup-norm 1. Proposition
More informationResearch Article Sufficient Optimality and Sensitivity Analysis of a Parameterized Min-Max Programming
Applied Mathematics Volume 2012, Article ID 692325, 9 pages doi:10.1155/2012/692325 Research Article Sufficient Optimality and Sensitivity Analysis of a Parameterized Min-Max Programming Huijuan Xiong,
More informationGeometry in a Fréchet Context: A Projective Limit Approach
Geometry in a Fréchet Context: A Projective Limit Approach Geometry in a Fréchet Context: A Projective Limit Approach by C.T.J. Dodson University of Manchester, Manchester, UK George Galanis Hellenic
More informationPOLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS
POLYNOMIAL OPTIMIZATION WITH SUMS-OF-SQUARES INTERPOLANTS Sercan Yıldız syildiz@samsi.info in collaboration with Dávid Papp (NCSU) OPT Transition Workshop May 02, 2017 OUTLINE Polynomial optimization and
More informationKey words. Complementarity set, Lyapunov rank, Bishop-Phelps cone, Irreducible cone
ON THE IRREDUCIBILITY LYAPUNOV RANK AND AUTOMORPHISMS OF SPECIAL BISHOP-PHELPS CONES M. SEETHARAMA GOWDA AND D. TROTT Abstract. Motivated by optimization considerations we consider cones in R n to be called
More informationLecture 5. The Dual Cone and Dual Problem
IE 8534 1 Lecture 5. The Dual Cone and Dual Problem IE 8534 2 For a convex cone K, its dual cone is defined as K = {y x, y 0, x K}. The inner-product can be replaced by x T y if the coordinates of the
More informationProximal Methods for Optimization with Spasity-inducing Norms
Proximal Methods for Optimization with Spasity-inducing Norms Group Learning Presentation Xiaowei Zhou Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology
More information