Supplement: Universal SelfConcordant Barrier Functions


 Molly Underwood
 1 years ago
 Views:
Transcription
1 IE Supplement: Universal SelfConcordant Barrier Functions
2 IE Recall that a selfconcordant barrier function for K is a barrier function satisfying 3 F (x)[h, h, h] 2( 2 F (x)[h, h]) 3/2, F (x)[h] θ( 2 F (x)[h, h]) 1/2, for any x int K and any direction h R n. Furthermore, we call a barrier function F (x) to be νlogarithmically homogeneous if for all x int K and t > 0. F (tx) = F (x) ν ln t
3 IE A fundamentally important result due to Nesterov and Nemirovski is the following: Theorem 1 Any closed convex cone admits a selfconcordant, logarithmically homogeneous barrier function where θ = O( n). In this note we shall show why this is the case. First, let us note some basic facts. Proposition 1 Suppose that F (x) is a smooth νlogarithmically homogeneous barrier function for K. Then the following identities hold where x int K and t > 0: F (tx) = 1 F (x); t 2 F (tx) = 1 t 2 2 F (x); 2 F (x)x = F (x); ( F (x)) T x = ν.
4 IE For an νlogarithmically homogeneous function, the second property of the selfconcordance always holds F (x)[h] = h T F (x) = h T 2 F (x)x = [( 2 F (x)) 1/2 h] T [( 2 F (x)) 1/2 x] h T 2 F (x)h x T 2 F (x)x = ν( 2 F (x)[h, h]) 1/2, where we used the CauchySchwartz inequality.
5 IE There are intimate relationships between a convex cone and its barrier function; the dual cone and the conjugate of the barrier funciton. Recall that the conjugate of a function f is: f (s) = sup{( s) T x f(x) x dom f}, where dom f stands for the domain of the function f. Suppose that f is a barrier function of K. Then f is a barrier function of K. Moreover, for x int dom f and s int dom f the following three statements are equivalent s = f(x); x = f (s); x T s = f(x) + f (s).
6 IE For a convex cone K, the following function is known as its characteristic function ϕ(x) = e x,y dy. K Let F (x) = ln ϕ(x). One can show the following properties of F : F (x) is a barrier function for K; F (x) is strictly convex; F (x) is nlogarithmically homogeneous.
7 IE Let us consider the last property. Consider a linear transformation A that keeps K invariant, i.e. AK = K; in that case, A T K = K. Then, ϕ(ax) = e Ax,y dy K = e x,a T y dy K }{{} = dy / det A y :=A T y K e x,y = ϕ(x)/ det A. Now, for t > 0, the transformation A = ti keeps K invariant. Therefore, ϕ(tx) = ϕ(x)/t n, and so F (tx) = F (x) nt.
8 IE Moreover, A keeps K invariant, because F (Ax) = F (x)/ det A we have F (Ax) = F (x) ln det A. Differentiating the above identity yields for any k 1. k F (Ax)[Ah, Ah,..., Ah] = k F (x)[h, h,..., h] }{{}}{{} k k In order to show that the first property of the selfconcordance is also satisfied, we fix a given point ι int K. For any x int K, there is a mapping A x such that ι = A x x. Let h = A x h. It will be sufficient to prove that there exists a constant C > 0 such that 3 F (ι)[h, h, h ] C( 2 F (ι)[h, h ]) 3/2 h R n which is true because 2 F (ι) is positive definite.
9 IE The characteristic function exists for any convex cone. The barrier function defined that way is also known as the universal barrier function. As we have just seen, it is also a selfconcordant barrier. One problem, however, is that the universal barrier function is not easily computable. For special cases, one may be able to compute the associated universal barrier function. For instance, it is easy to see that the characteristic function for R n + is: R n + e x 1y 1 x n y n dy = 1/ n x i, and so the universal barrier function is simply the logarithmic barrier function n i=1 ln x i. i=1
10 IE Interestingly, there is also a very nice geometric interpretation of the universal barrier function. Let S be a convex set. Introduce the set function S (x) := ( x + S). Let u(x) := ln(vol(s (x))). Nesterov and Nemirovski showed that u(x) is a selfconcordant barrier function for S with complexity parameter θ = O( n). Güler proved that if S is a convex cone (S = K) then the following identity holds F (x) = u(x) + ln n!.
11 IE Key References: Yu. Nesterov and A. Nemirovski, InteriorPoint Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, 13, O. Güler, Barrier Functions in Interior Point Methods, Mathematics of Operations Research, 21, pp , 1996.
Largest 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 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 informationPrimalDual Symmetric InteriorPoint Methods from SDP to Hyperbolic Cone Programming and Beyond
PrimalDual Symmetric InteriorPoint 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 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 innerproduct can be replaced by x T y if the coordinates of the
More informationRecursive Construction of Optimal SelfConcordant Barriers for Homogeneous Cones
Recursive Construction of Optimal SelfConcordant Barriers for Homogeneous Cones OLENA SHEVCHENKO November 20, 2006 Abstract. In this paper, we give a recursive formula for optimal dual barrier functions
More informationAugmented selfconcordant barriers and nonlinear optimization problems with finite complexity
Augmented selfconcordant barriers and nonlinear optimization problems with finite complexity Yu. Nesterov J.Ph. Vial October 9, 2000 Abstract In this paper we study special barrier functions for the
More informationOn selfconcordant barriers for generalized power cones
On selfconcordant barriers for generalized power cones Scott Roy Lin Xiao January 30, 2018 Abstract In the study of interiorpoint methods for nonsymmetric conic optimization and their applications, Nesterov
More informationL. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones. definition. spectral decomposition. quadratic representation. logdet barrier 181
L. Vandenberghe EE236C (Spring 2016) 18. Symmetric cones definition spectral decomposition quadratic representation logdet barrier 181 Introduction This lecture: theoretical properties of the following
More informationBarrier Method. Javier Peña Convex Optimization /36725
Barrier Method Javier Peña Convex Optimization 10725/36725 1 Last time: Newton s method For rootfinding F (x) = 0 x + = x F (x) 1 F (x) For optimization x f(x) x + = x 2 f(x) 1 f(x) Assume f strongly
More information12. Interiorpoint methods
12. Interiorpoint methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
More informationConstructing selfconcordant barriers for convex cones
CORE DISCUSSION PAPER 2006/30 Constructing selfconcordant barriers for convex cones Yu. Nesterov March 21, 2006 Abstract In this paper we develop a technique for constructing selfconcordant barriers
More informationOn Conically Ordered Convex Programs
On Conically Ordered Convex Programs Shuzhong Zhang May 003; revised December 004 Abstract In this paper we study a special class of convex optimization problems called conically ordered convex programs
More informationUsing Schur Complement Theorem to prove convexity of some SOCfunctions
Journal of Nonlinear and Convex Analysis, vol. 13, no. 3, pp. 41431, 01 Using Schur Complement Theorem to prove convexity of some SOCfunctions JeinShan Chen 1 Department of Mathematics National Taiwan
More informationNonsymmetric potentialreduction methods for general cones
CORE DISCUSSION PAPER 2006/34 Nonsymmetric potentialreduction methods for general cones Yu. Nesterov March 28, 2006 Abstract In this paper we propose two new nonsymmetric primaldual potentialreduction
More informationAdvances in Convex Optimization: Theory, Algorithms, and Applications
Advances in Convex Optimization: Theory, Algorithms, and Applications Stephen Boyd Electrical Engineering Department Stanford University (joint work with Lieven Vandenberghe, UCLA) ISIT 02 ISIT 02 Lausanne
More informationAgenda. Interior Point Methods. 1 Barrier functions. 2 Analytic center. 3 Central path. 4 Barrier method. 5 Primaldual path following algorithms
Agenda Interior Point Methods 1 Barrier functions 2 Analytic center 3 Central path 4 Barrier method 5 Primaldual path following algorithms 6 Nesterov Todd scaling 7 Complexity analysis Interior point
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 informationA PrimalDual SecondOrder Cone Approximations Algorithm For Symmetric Cone Programming
A PrimalDual SecondOrder Cone Approximations Algorithm For Symmetric Cone Programming Chek Beng Chua Abstract This paper presents the new concept of secondorder cone approximations for convex conic
More informationA New SelfDual Embedding Method for Convex Programming
A New SelfDual Embedding Method for Convex Programming Shuzhong Zhang October 2001; revised October 2002 Abstract In this paper we introduce a conic optimization formulation to solve constrained convex
More informationDeterminant maximization with linear. S. Boyd, L. Vandenberghe, S.P. Wu. Information Systems Laboratory. Stanford University
Determinant maximization with linear matrix inequality constraints S. Boyd, L. Vandenberghe, S.P. Wu Information Systems Laboratory Stanford University SCCM Seminar 5 February 1996 1 MAXDET problem denition
More informationA SecondOrder PathFollowing Algorithm for Unconstrained Convex Optimization
A SecondOrder PathFollowing Algorithm for Unconstrained Convex Optimization Yinyu Ye Department is Management Science & Engineering and Institute of Computational & Mathematical Engineering Stanford
More information1. Gradient method. gradient method, firstorder methods. quadratic bounds on convex functions. analysis of gradient method
L. Vandenberghe EE236C (Spring 2016) 1. Gradient method gradient method, firstorder methods quadratic bounds on convex functions analysis of gradient method 11 Approximate course outline Firstorder
More informationConvex Feasibility Problems
Laureate Prof. Jonathan Borwein with Matthew Tam http://carma.newcastle.edu.au/drmethods/paseky.html Spring School on Variational Analysis VI Paseky nad Jizerou, April 19 25, 2015 Last Revised: May 6,
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 Minimum volume ellipsoid around a set LöwnerJohn ellipsoid
More informationPrimalDual InteriorPoint Methods. Javier Peña Convex Optimization /36725
PrimalDual InteriorPoint Methods Javier Peña Convex Optimization 10725/36725 Last time: duality revisited Consider the problem min x subject to f(x) Ax = b h(x) 0 Lagrangian L(x, u, v) = f(x) + u T
More informationarxiv: v1 [math.fa] 16 Jun 2011
arxiv:1106.3342v1 [math.fa] 16 Jun 2011 Gauge functions for convex cones B. F. Svaiter August 20, 2018 Abstract We analyze a class of sublinear functionals which characterize the interior and the exterior
More informationSecondorder cone programming
Outline Secondorder 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 informationInterior Point Methods: SecondOrder 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: SecondOrder Cone Programming and Semidefinite Programming Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio
More informationEuler Equations: local existence
Euler Equations: local existence Mat 529, Lesson 2. 1 Active scalars formulation We start with a lemma. Lemma 1. Assume that w is a magnetization variable, i.e. t w + u w + ( u) w = 0. If u = Pw then u
More informationInterior Point Algorithms for Constrained Convex Optimization
Interior Point Algorithms for Constrained Convex Optimization Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Inequality constrained minimization problems
More information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions logconcave and logconvex functions
More information10. Unconstrained minimization
Convex Optimization Boyd & Vandenberghe 10. Unconstrained minimization terminology and assumptions gradient descent method steepest descent method Newton s method selfconcordant functions implementation
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17
EE/ACM 150  Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko
More informationPOLYNOMIAL OPTIMIZATION WITH SUMSOFSQUARES INTERPOLANTS
POLYNOMIAL OPTIMIZATION WITH SUMSOFSQUARES 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 informationPrimal Central Paths and Riemannian Distances for Convex Sets
«FOCM 128 layout: Small Extended v.1.2 reference style: focm file: focm919.tex (Michail) aid: 919 doctopic: OriginalPaper class: sprsmallv1.1 v.27/11/26 Prn:5/12/27; 11:4 p. 1» 1 2 3 4 5 6 7 8 9 1 11
More information12. Interiorpoint methods
12. Interiorpoint methods Convex Optimization Boyd & Vandenberghe inequality constrained minimization logarithmic barrier function and central path barrier method feasibility and phase I methods complexity
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 1 Minimum volume ellipsoid around a set LöwnerJohn ellipsoid
More information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions logconcave and logconvex functions
More informationPRIMALDUAL INTERIORPOINT METHODS FOR SELFSCALED CONES
PRIMALDUAL INTERIORPOINT METHODS FOR SELFSCALED CONES YU. E. NESTEROV AND M. J. TODD Abstract. In this paper we continue the development of a theoretical foundation for efficient primaldual interiorpoint
More informationHessian Riemannian Gradient Flows in Convex Programming
Hessian Riemannian Gradient Flows in Convex Programming Felipe Alvarez, Jérôme Bolte, Olivier Brahic INTERNATIONAL CONFERENCE ON MODELING AND OPTIMIZATION MODOPT 2004 Universidad de La Frontera, Temuco,
More informationAn interiorpoint trustregion polynomial algorithm for convex programming
An interiorpoint trustregion polynomial algorithm for convex programming Ye LU and Yaxiang YUAN Abstract. An interiorpoint trustregion algorithm is proposed for minimization of a convex quadratic
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:1012: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 informationPrimal Central Paths and Riemannian Distances for Convex Sets
Found Comput Math (28) 8: 533 56 DOI 1.17/s12879194 Primal Central Paths and Riemannian Distances for Convex Sets Y. Nesterov A. Nemirovski Received: 2 November 25 / Revised: 29 May 27 / Accepted: 5
More informationLECTURE 7. k=1 (, v k)u k. Moreover r
LECTURE 7 Finite rank operators Definition. T is said to be of rank r (r < ) if dim T(H) = r. The class of operators of rank r is denoted by K r and K := r K r. Theorem 1. T K r iff T K r. Proof. Let T
More informationSelfConcordant Barrier Functions for Convex Optimization
Appendix F SelfConcordant Barrier Functions for Convex Optimization F.1 Introduction In this Appendix we present a framework for developing polynomialtime algorithms for the solution of convex optimization
More informationConvex Optimization. Prof. Nati Srebro. Lecture 12: InfeasibleStart Newton s Method Interior Point Methods
Convex Optimization Prof. Nati Srebro Lecture 12: InfeasibleStart Newton s Method Interior Point Methods Equality Constrained Optimization f 0 (x) s. t. A R p n, b R p Using access to: 2 nd order oracle
More informationInner approximation of convex cones via primaldual ellipsoidal norms
Inner approximation of convex cones via primaldual ellipsoidal norms by Miaolan Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of
More informationConvex Optimization. Newton s method. ENSAE: Optimisation 1/44
Convex Optimization Newton s method ENSAE: Optimisation 1/44 Unconstrained minimization minimize f(x) f convex, twice continuously differentiable (hence dom f open) we assume optimal value p = inf x f(x)
More informationLecture 15 Newton Method and SelfConcordance. October 23, 2008
Newton Method and SelfConcordance October 23, 2008 Outline Lecture 15 Selfconcordance Notion Selfconcordant Functions Operations Preserving Selfconcordance Properties of Selfconcordant Functions Implications
More informationPrimaldual IPM with Asymmetric Barrier
Primaldual IPM with Asymmetric Barrier Yurii Nesterov, CORE/INMA (UCL) September 29, 2008 (IFOR, ETHZ) Yu. Nesterov Primaldual IPM with Asymmetric Barrier 1/28 Outline 1 Symmetric and asymmetric barriers
More informationESTIMATES FOR THE MONGEAMPERE EQUATION
GLOBAL W 2,p ESTIMATES FOR THE MONGEAMPERE EQUATION O. SAVIN Abstract. We use a localization property of boundary sections for solutions to the MongeAmpere equation obtain global W 2,p estimates under
More informationOn well definedness of the Central Path
On well definedness of the Central Path L.M.Graña Drummond B. F. Svaiter IMPAInstituto de Matemática Pura e Aplicada Estrada Dona Castorina 110, Jardim Botânico, Rio de JaneiroRJ CEP 22460320 Brasil
More informationCentral Paths in Semidefinite Programming, Generalized Proximal Point Method and Cauchy Trajectories in Riemannian Manifolds
Central Paths in Semidefinite Programming, Generalized Proximal Point Method and Cauchy Trajectories in Riemannian Manifolds da Cruz Neto, J. X., Ferreira, O. P., Oliveira, P. R. and Silva, R. C. M. February
More informationLecture 5. Theorems of Alternatives and SelfDual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and SelfDual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c
More informationAn Optimal Affine Invariant Smooth Minimization Algorithm.
An Optimal Affine Invariant Smooth Minimization Algorithm. Alexandre d Aspremont, CNRS & École Polytechnique. Joint work with Martin Jaggi. Support from ERC SIPA. A. d Aspremont IWSL, Moscow, June 2013,
More informationConvex analysis and profit/cost/support functions
Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m Convex analysts may give one of two
More informationMatrix Support Functional and its Applications
Matrix Support Functional and its Applications James V Burke Mathematics, University of Washington Joint work with Yuan Gao (UW) and Tim Hoheisel (McGill), CORS, Banff 2016 June 1, 2016 Connections What
More informationKey words. Complementarity set, Lyapunov rank, BishopPhelps cone, Irreducible cone
ON THE IRREDUCIBILITY LYAPUNOV RANK AND AUTOMORPHISMS OF SPECIAL BISHOPPHELPS CONES M. SEETHARAMA GOWDA AND D. TROTT Abstract. Motivated by optimization considerations we consider cones in R n to be called
More informationLecture 5: Hyperbolic polynomials
Lecture 5: Hyperbolic polynomials Robin Pemantle University of Pennsylvania pemantle@math.upenn.edu Minerva Lectures at Columbia University 16 November, 2016 Ubiquity of zeros of polynomials The one contribution
More informationNew stopping criteria for detecting infeasibility in conic optimization
Optimization Letters manuscript No. (will be inserted by the editor) New stopping criteria for detecting infeasibility in conic optimization Imre Pólik Tamás Terlaky Received: March 21, 2008/ Accepted:
More information15. Conic optimization
L. Vandenberghe EE236C (Spring 216) 15. Conic optimization conic linear program examples modeling duality 151 Generalized (conic) inequalities Conic inequality: a constraint x K where K is a convex cone
More informationEinsteinHessian barriers on convex cones
EinsteinHessian barriers on convex cones Roland Hildebrand May 1, 01 Abstract On the interior of a regular convex cone K R n there exist two canonical Hessian metrics, the one generated by the logarithm
More informationOn John type ellipsoids
On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and nontrivial continuous map u K which associates ellipsoids to
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 informationA LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGEAMPERE EQUATION
A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGEAMPERE EQUATION O. SAVIN. Introduction In this paper we study the geometry of the sections for solutions to the Monge Ampere equation det D 2 u = f, u
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 informationINTERIORPOINT ALGORITHMS FOR CONVEX OPTIMIZATION BASED ON PRIMALDUAL METRICS
INTERIORPOINT ALGORITHMS FOR CONVEX OPTIMIZATION BASED ON PRIMALDUAL METRICS TOR MYKLEBUST, LEVENT TUNÇEL Abstract. We propose and analyse primaldual interiorpoint algorithms for convex optimization
More informationApplications of Linear Programming
Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 9 Nonlinear programming In case of LP, the goal
More informationConvex Functions. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)
Convex Functions Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470  Convex Optimization Fall 201718, HKUST, Hong Kong Outline of Lecture Definition convex function Examples
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 informationConvex Functions. Pontus Giselsson
Convex Functions Pontus Giselsson 1 Today s lecture lower semicontinuity, closure, convex hull convexity preserving operations precomposition with affine mapping infimal convolution image function supremum
More informationLecture: Smoothing.
Lecture: Smoothing http://bicmr.pku.edu.cn/~wenzw/opt2018fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghe s lecture notes Smoothing 2/26 introduction smoothing via conjugate
More informationUnconstrained minimization: assumptions
Unconstrained minimization I terminology and assumptions I gradient descent method I steepest descent method I Newton s method I selfconcordant functions I implementation IOE 611: Nonlinear Programming,
More informationPrimaldual pathfollowing algorithms for circular programming
Primaldual pathfollowing algorithms for circular programming Baha Alzalg Department of Mathematics, The University of Jordan, Amman 1194, Jordan July, 015 Abstract Circular programming problems are a
More informationInterior Point Methods for Linear Programming: Motivation & Theory
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 for Linear Programming: Motivation & Theory Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio
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 informationUnconstrained minimization
CSCI5254: Convex Optimization & Its Applications Unconstrained minimization terminology and assumptions gradient descent method steepest descent method Newton s method selfconcordant functions 1 Unconstrained
More informationSecond Order Elliptic PDE
Second Order Elliptic PDE T. Muthukumar tmk@iitk.ac.in December 16, 2014 Contents 1 A Quick Introduction to PDE 1 2 Classification of Second Order PDE 3 3 Linear Second Order Elliptic Operators 4 4 Periodic
More informationThe local equicontinuity of a maximal monotone operator
arxiv:1410.3328v2 [math.fa] 3 Nov 2014 The local equicontinuity of a maximal monotone operator M.D. Voisei Abstract The local equicontinuity of an operator T : X X with proper Fitzpatrick function ϕ T
More informationINTERIORPOINT ALGORITHMS FOR CONVEX OPTIMIZATION BASED ON PRIMALDUAL METRICS
INTERIORPOINT ALGORITHMS FOR CONVEX OPTIMIZATION BASED ON PRIMALDUAL METRICS TOR G. J. MYKLEBUST, LEVENT TUNÇEL Abstract. We propose and analyse primaldual interiorpoint algorithms for convex optimization
More informationMATH 31BH Homework 5 Solutions
MATH 3BH Homework 5 Solutions February 4, 204 Problem.8.2 (a) Let x t f y = x 2 + y 2 + 2z 2 and g(t) = t 2. z t 3 Then by the chain rule a a a D(g f) b = Dg f b Df b c c c = [Dg(a 2 + b 2 + 2c 2 )] [
More informationSelfequilibrated Functions in Dual Vector Spaces: a Boundedness Criterion
Selfequilibrated Functions in Dual Vector Spaces: a Boundedness Criterion Michel Théra LACO, UMRCNRS 6090, Université de Limoges michel.thera@unilim.fr reporting joint work with E. Ernst and M. Volle
More informationSobolev regularity for the MongeAmpère equation, with application to the semigeostrophic equations
Sobolev regularity for the MongeAmpère equation, with application to the semigeostrophic equations Alessio Figalli Abstract In this note we review some recent results on the Sobolev regularity of solutions
More informationBandit Convex Optimization
March 7, 2017 Table of Contents 1 (BCO) 2 Projection Methods 3 Barrier Methods 4 Variance reduction 5 Other methods 6 Conclusion Learning scenario Compact convex action set K R d. For t = 1 to T : Predict
More informationSecondOrder Cone Program (SOCP) Detection and Transformation Algorithms for Optimization Software
and SecondOrder Cone Program () and Algorithms for Optimization Software Jared Erickson JaredErickson2012@u.northwestern.edu Robert 4er@northwestern.edu Northwestern University INFORMS Annual Meeting,
More informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very wellwritten and a pleasure to read. The
More informationDedicated to Michel Théra in honor of his 70th birthday
VARIATIONAL GEOMETRIC APPROACH TO GENERALIZED DIFFERENTIAL AND CONJUGATE CALCULI IN CONVEX ANALYSIS B. S. MORDUKHOVICH 1, N. M. NAM 2, R. B. RECTOR 3 and T. TRAN 4. Dedicated to Michel Théra in honor of
More informationLecture No 1 Introduction to Diffusion equations The heat equat
Lecture No 1 Introduction to Diffusion equations The heat equation Columbia University IAS summer program June, 2009 Outline of the lectures We will discuss some basic models of diffusion equations and
More informationAn Infeasible Interior Proximal Method for Convex Programming Problems with Linear Constraints 1
An Infeasible Interior Proximal Method for Convex Programming Problems with Linear Constraints 1 Nobuo Yamashita 2, Christian Kanzow 3, Tomoyui Morimoto 2, and Masao Fuushima 2 2 Department of Applied
More informationOptimal Transportation. Nonlinear Partial Differential Equations
Optimal Transportation and Nonlinear Partial Differential Equations Neil S. Trudinger Centre of Mathematics and its Applications Australian National University 26th Brazilian Mathematical Colloquium 2007
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 informationA polynomialtime interiorpoint method for conic optimization, with inexact barrier evaluations
A polynomialtime interiorpoint method for conic optimization, with inexact barrier evaluations Simon P. Schurr Dianne P. O Leary André L. Tits Technical Report University of Maryland March 9, 2008 Abstract
More informationMath 4263 Homework Set 1
Homework Set 1 1. Solve the following PDE/BVP 2. Solve the following PDE/BVP 2u t + 3u x = 0 u (x, 0) = sin (x) u x + e x u y = 0 u (0, y) = y 2 3. (a) Find the curves γ : t (x (t), y (t)) such that that
More informationDeterministic Dynamic Programming
Deterministic Dynamic Programming 1 Value Function Consider the following optimal control problem in Mayer s form: V (t 0, x 0 ) = inf u U J(t 1, x(t 1 )) (1) subject to ẋ(t) = f(t, x(t), u(t)), x(t 0
More informationAdvanced Analysis Qualifying Examination Department of Mathematics and Statistics University of Massachusetts. Monday, August 26, 2013
NAME: Advanced Analysis Qualifying Examination Department of Mathematics and Statistics University of Massachusetts Monday, August 26, 2013 Instructions 1. This exam consists of eight (8) problems all
More informationLecture 1: Background on Convex Analysis
Lecture 1: Background on Convex Analysis John Duchi PCMI 2016 Outline I Convex sets 1.1 Definitions and examples 2.2 Basic properties 3.3 Projections onto convex sets 4.4 Separating and supporting hyperplanes
More informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex nonsmooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationA note on the convex infimum convolution inequality
A note on the convex infimum convolution inequality Naomi Feldheim, Arnaud Marsiglietti, Piotr Nayar, Jing Wang Abstract We characterize the symmetric measures which satisfy the one dimensional convex
More informationChange Of Variable Theorem: Multiple Dimensions
Change Of Variable Theorem: Multiple Dimensions Moulinath Banerjee University of Michigan August 30, 01 Let (X, Y ) be a twodimensional continuous random vector. Thus P (X = x, Y = y) = 0 for all (x,
More information