Distributed Control of Connected Vehicles and Fast ADMM for Sparse SDPs
|
|
- Brook Phelps
- 5 years ago
- Views:
Transcription
1 Distributed Control of Connected Vehicles and Fast ADMM for Sparse SDPs Yang Zheng Department of Engineering Science, University of Oxford Homepage: Talk at Cranfield University, May 2017
2 OUTLINE 1 Distributed Control of Connected Vehicles 2 Fast ADMM for Sparse SDPs 2017/5/9 2
3 Outline 1 Distributed Control of Connected Vehicles 1) Background 2) Modeling: the four-component framework 3) Analysis: Stability and Robustness 4) Synthesis: Design of DMPC 1. Zheng, Y., Li, S. E., Wang, J., Cao, D., & Li, K. (2016). Stability and scalability of homogeneous vehicular platoon: Study on the influence of information flow topologies. IEEE Transactions on Intelligent Transportation Systems, 17(1), Zheng, Y., Li, S. E., Li, K., & Wang, L. Y. (2016). Stability margin improvement of vehicular platoon considering undirected topology and asymmetric control. IEEE Transactions on Control Systems Technology, 24(4), Zheng, Y., Li, S. E., Li, K., Borrelli, F., & Hedrick, J. K. (2017). Distributed model predictive control for heterogeneous vehicle platoons under unidirectional topologies. IEEE Transactions on Control Systems Technology, 25(3), /5/9 3
4 1. Distributed Control of Connected Vehicles Background: Vehicle Platoon Control Objectives a) to ensure all the vehicles in the same group to move at the same speed with the leader b) to maintain the desired spaces between adjacent vehicles Potential Benefits Improve traffic efficiency, enhance road safety, and reduce fuel consumption, etc. The earliest implementation can date back to the PATH program during the last eighties Real-world experiments USA - PATH Europe - SARTRE Japan - Energy ITS 4
5 1. Distributed Control of Connected Vehicles View platoons from a networked control perspective Typical Communication Topology Different Communication Topologies ( a ) Connected Vehicle by V2V ( b ) ( c ) ( d ) ( e ) New challenges: Variety of topologies ( f ) 1. Dynamical Modeling 2. Performance Analysis 3. Controller Synthesis 1. The four-component framework 2. Stability and robustness analysis 3. Design of Distributed Model Predictive Control 5
6 1. Distributed Control of Connected Vehicles Modeling: Networks of Dynamical Systems From Control Perspective Source: Applications 1. Dynamics + Communication 2. Control Theory + Graph Theory Research topics 1. Dynamic: single integrator, double integrator, linear dynamic, nonlinear dynamic 2. Communication: data rate, switching topology, time-delay Nature Transportation Smart grid Vehicle platoons can be viewed as a special one-dimensional network of dynamical system 6
7 1. Distributed Control of Connected Vehicles Modeling of Platoons: the four-component framework Distributed Controller Information Flow Topology C N u N Controller C i C i-1 C 1 u i u i-1 u 1 v 0 LV d r,i t d des,i N node i i Vehicle Dynamics Formation Geometry Vehicle Dynamics: linear dynamics, nonlinear dyanmics; Formation Geometry: constant spacing, time headway policy. Distributed Controller: linear controller, MPC, robust control; Information Flow Topology: PF, PFL, BD, etc; Algebraic graph theory Explicitly highlight the influence of different components! 7
8 1. Distributed Control of Connected Vehicles Modeling: Categorization of existing works [Li and Zheng et al., 2015] 8
9 1. Distributed Control of Connected Vehicles Modeling: Typical case 1. Linear dynamics 2. Constant spacing policy 3. Communication topology 4. Linear controller Closed-loop dynamics x i t = u i t = xሶ i t = Ax i t + B 1 u i t + B 2 w i t p i v i a i, A = τ, B 1 = τ, B 2 = lim v i t v 0 t = 0, i = 1,2, N t lim p, i 1 t p i t d i 1,i = 0 t Pinning matrix P, Adjacency matrix A, Laplacian matrix L j I i k p p i p j d i,j + k v v i v j + k a a i a j τ ሶ X = I N A L + P B 1 k T X + I N B 2 W 9
10 1. Distributed Control of Connected Vehicles Analysis: Stability and Robustness Performance index Closed-loop Stability: Stability Margin: ሶ X = I N A L + P B 1 k T X + I N B 2 W Im Stability Margin d min Robustness index: R w i t + L 2 = න 0 w i t 2 dt < AF f2l = sup p N L 2 w 1 L2 = G f2l s H AF a2a = sup Y L 2 W L2 = G a2a s H 10c
11 1. Distributed Control of Connected Vehicles Stability Region Analysis [Zheng et al. 2014, ITSC] Consider a homogeneous platoon with linear controllers given by ሶ X = I N A L + P Bk T X If graph G satisfies certain conditions (all the eigenvalues of L + P are positive real numbers), the platoon is asymptotically stable if and only if Proof sketch: k p > 0 k v > k p ττmin λ i k a + 1 k a > 1Τmax λ i Similarity transformation + Routh Hurwitz stability criterion S I N A L + P Bk T si A λ i Bk T = s 3 + λ ik a +1 τ N = ራ i=1 S A λ i Bk T s 2 + λ ik v τ s + λ ik p τ. 11c
12 1. Distributed Control of Connected Vehicles Scaling of Stability Margin [Zheng et al. 2016, IEEE ITS] Consider a homogeneous platoon with linear controllers given by ሶ X = I N A L + P Bk T X (2.1) if the graph G is in Bidirectional topology, then the stability margin decays to zero as O 1ΤN 2 (2.2) if the graph G is in BDL topology, then the stability margin is always bounded away from zero. N N-1 N Im Bidirectional (BD) topology Stability Margin d min R N N-1 N Bidirectional-leader (BDL) topology 12c
13 1. Distributed Control of Connected Vehicles Stability Margin Improvement : Asymmetric control [Zheng et al. 2016, IEEE CST] Consider a homogeneous platoon under the BD topology with the asymmetric controller architecture given by ሶ X = I N A L BD + P BD ε Bk T X (3.2) For any fixed ϵ 0,1, the stability margin is bounded away from zero and independent of the platoon size N (N can be any finite integer). k f N k f N-1 k f 3 k f 2 k f 1 k b N-1 N N-1 k b N-2 k b 2 2 k b Asymmetric control The controller is called asymmetric, if LV ቐ k f i = 1 + ε k, k b i = 1 ε k i = 1,, N 1 k f N = 1 + ε k, where ε 0,1 is called the asymmetric degree. Note that if ε = 0, then it is reduced to the symmetric case. 13c
14 Stability Margin Spacing Error (m) 1. Distributed Control of Connected Vehicles Stability Margin Improvement : Asymmetric control [Zheng et al. 2016, IEEE CST] Tradeoff:Convergence Speed and Transient Performance Benefit: bounded stability margin good for convergence speed Cost: overshooting phenomena in transient process. Spacing Error (m) Spacing Error (m) ε=0 ε=0.2 ε=0.4 ε= The number of vehicles:n Spacing Error (m) Time (s) (a) Time (s) Time (s) (b) Time (s) (c) (d) Space errors for homogeneous platoons under BD topology with different asymmetric degree ϵ. (a) ϵ=0 (symmetric); (b) ϵ=0.2; (c) ϵ=0.4; (d) ϵ=0.6
15 N=2n c N=c(k+1) n+2 c+1 1. Distributed Control of Connected Vehicles Stability Margin Improvement : Topological Selection [Zheng et al. 2016, IEEE CST] Consider a homogeneous platoon with linear controllers given by ሶ X = I N A L + P Bk T X (3.1) if the graph G is undirected, to maintain bounded stability margin, it needs at least lots of followers (i.e. Ω(N) = O(N)) to obtain the leader s information. To maintain bounded stability margin, the tree depth of graph G should be a constant number and independent of the platoon size N N=2n n n+1 n N=c(k+1) c ck+1 ck c(k-1)+1 c n-1 n 1 c+1 c(k-1)+1 ck+1 15c
16 Stability Margin 1. Distributed Control of Connected Vehicles Stability Margin Improvement : Topological Selection [Zheng et al. 2016, IEEE CST] Ω(N)=N/2,Tree depth: c=2 Ω(N)=N/4,Tree depth: c=4 Ω(N)=N/2,Tree depth: c=n/2 Ω(N)=N/4,Tree depth: c=3n/ The number of vehicles:n Extending information flow to reduce the tree depth is one major way to guarantee a bounded stability margin. 16c
17 1. Distributed Control of Connected Vehicles Design of DMPC for Nonlinear Heterogeneous platoons Design a distributed controller for a heterogeneous platoon considering nonlinear dynamics, input constraints and variety of communication topologies Nonlinear Heterogeneous model Design of DMPC pሶ i t = v i t η T,i T r i t = m i vሶ i t + C A,i v 2 i t + m i gf i w,i τ i Tሶ i t + T i t = u i t discretization x i t + 1 = φ i x i + ψ i u i t Stability analysis Linear homogeneous platoon Performance analysis Simulation Benchmark 17
18 1. Distributed Control of Connected Vehicles DMPC: Local open-loop optimal control problem Problem F i : For i 1,2,, N at time t min J i y p U i : ȁt, u p a i : ȁt, y i : ȁt, y i i s.t. N p 1 = p xሶ i k=0 l i y i p p kȁt, u i ȁ k + 1 t = φ i y i p y i p x i p a kȁt, y i ȁ k t p kȁt = γx i a ȁ : t a kȁt, y i + ψ i u i p ȁ k t k = 0,, N p 1 x i p u i p N p หt = 1 I i T i p ȁ 0 t = x i t ȁ k t U j I i a y j p N p หt = h i v i N p หt d j,i N p หt ȁ k t ȁ k t, Cost function Dynamic constraints in predictive horizon Input constraints Terminal Constraints stability This is based on the local average of neighboring outputs. 18
19 1. Distributed Control of Connected Vehicles DMPC: Local open-loop optimal control problem Construction of local cost function l i y i p p kȁt, u i kȁ a t, y i kȁ a t, y i ȁ k t Design Parameters = Q i y i p + R i u i p + + F i y i p j N i p G i y i ȁ k t y des,i ȁ k t h i v i p kȁ a t y i kȁ a t y j ȁ k t ȁ k t ȁ k t ȁ k t ሚd i,j 2 Tracking leader p i = 0, Q i = 0 Penalize the input R i 0 Maintain its assumed output F i 0 Maintain the assumed output of its neighbors G i 0 This output is sent to the nodes in set O i Node i tries to maintain the output as close to the assumed trajectories of its neighbors (i.e., j N i ) as possible Stability j 1 j 2 j j 3 j 4 O j = j 1, j 2, j 3, j 4. i 1 i 2 i i 3 i 4 N i = i 1, i 2, i 3, i 4 19
20 1. Distributed Control of Connected Vehicles Assumption 1 (Unidirectional topology): The graph G contains a spanning tree rooting at the leader, and the communications are unidirectional from preceding vehicles to downstream ones Sufficient conditions [Zheng et al IEEE CST] If G satisfies Assumption 1, a platoon under proposed DMPC is asymptotically stable if satisfying The main strategy is to construct a proper Lyapunov function for the platoon and prove its decreasing property F i j O i G j, i N ( a ) ( b ) ( c ) sum of local cost functions ( d ) N N-1 N LV
21 Spacing error (m) Spacing error (m) Spacing error (m) Spacing error (m) 4. Synthesis: Design of DMPC The desired trajectory 20 mτs v 0 = ቐ20 + 2t mτs 22 mτs Weights PF PLF TPF TPLF F i F i = 10I 2, i N G i G 1 = 0, G i = 5I 2, i N\ 1 Q 1 = 10I 2, Q i Q i = 0, i N\ 1 R i R i = I 2, i N F i = 10I 2, i N G 1 = 0, G i = 5I 2, i N\ 1 Q i = 10I 2, i N R i = I 2, i N F i = 10I 2, i N G 1 = 0, G i = 5I 2, i N\ 1 Q 1 = 10I 2, Q 2 = 10I 2, Q i = 0, i N\ 1,2 R i = I 2, i N F i = 10I 2, i N G 1 = 0, G i = 5I 2, i N\ 1 Q i = 10I 2, i N R i = I 2, i N t 1 s 1s < t 2 s t > 2s N N-1 N-2 ( a ) ( b ) ( c ) ( d ) LV Time (s) Time (s) Time (s) Time (s) (a) PF (b) PLF (c) TPF (d) TPLF 21
22 Outline 2 Fast ADMM for Sparse SDPs 1) SDPs with Chordal Sparsity 2) ADMM for Primal and Dual Sparse SDPs 3) ADMM for the Homogeneous Self-dual Embedding 4) CDCS: Cone Decomposition Conic Solver 1. Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., & Wynn, A. (2016). Fast ADMM for semidefinite programs with chordal sparsity. arxiv preprint arxiv: Zheng, Y., Fantuzzi, G., Papachristodoulou, A., Goulart, P., & Wynn, A. (2016). Fast ADMM for homogeneous selfdual embeddings of sparse SDPs. arxiv preprint arxiv: /5/9 22
23 1. SDPs with Chordal Sparsity Standard Primal-dual Semidefinite Programs (SDPs) Dual Applications: control theory, power systems, polynomial optimization, combinatorics, operations research, etc. Control of a networked system (e.g., via Lyapunov theory) Picture sources: Optimal power flow problem (e.g., by dropping a rank constraint) 23
24 1. SDPs with Chordal Sparsity Standard Primal-dual Semidefinite Programs (SDPs) Dual Applications: control theory, fluid mechanics, polynomial optimization, combinatorics, operations research, etc. Interior-point solvers: SeDuMi, SDPA, SDPT3 (suitable for small and medium-sized problems); Modelling package: YALMIP, CVX; Large-scale cases: it is important to exploit the inherent structure of the instances (De Klerk, 2010): Low Rank Algebraic Symmetry Chordal Sparsity: Second-order methods: Fukuda et al., 2001; Nakata et al., 2003; Andersen et al., 2010; First-order methods: Madani et al. 2015; Sun, Andersen, and Vandenberghe,
25 1. SDPs with Chordal Sparsity Sparsity Pattern of Matrices Dual Sparse matrices S n E, 0 = S + n E, 0 = ȁ X S n X ij = 0, i, j E ȁ X S n E, 0 X 0 S n E,? = the set of n n partial symmetric matrices with elements defined on E. S n + E,? = X S n E,? ȁ M 0, M ij = X ij, i, j E S + n E,? and S + n E, 0 are dual cones of each other. 25
26 1. SDPs with Chordal Sparsity Chordal Graph A graph G is chordal if every cycle of length at least four has a chord. Any non-chordal graph can be chordal extended; Chordal extension A chordal graph can be decomposed into its maximal cliques C = C 1, C 2,, C p. Cliques in a graph are maximal complete subgraphs 26
27 1. SDPs with Chordal Sparsity Clique Decomposition Given a choral graph G = V, E with a set of maximal cliques C 1, C 2,, C p Grone s Theorem: X S n + E,? if and only if X C k 0, k = 1,, p. X C 1 0 X C 2 0 X S + n E,? i.e., matrix X is PSD completable X C
28 1. SDPs with Chordal Sparsity Clique Decomposition Given a choral graph G = V, E with a set of maximal cliques C 1, C 2,, C p Agler s Theorem: X S + n E, 0 if and only if there exists M k S + n C k p such that X = σ k=1 M k. X S + n E, 0 M 1 S + n C 1 M 2 S + n C 2 M 3 S + n C 3 Sparse Cone Decomposition (chordal) S + n E,? Grone s Theorem Dual Dual S + n E, 0 Agler s Theorem Topics in this talk ADMM for primal and dual SDPs; ADMM for the homogeneous self-dual embedding; CDCS: Cone Decomposition Conic Solver. 28
29 1. SDPs with Chordal Sparsity ADMM algorithm Augmented Lagrangian ADMM steps Iterations of ADMM: a) An x-minimization step b) A y-minimization step c) A dual variable update Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1),
30 2. ADMM for Primal and Dual Sparse SDPs Aggregate sparsity pattern of matrices A union of patterns of C, A 1, A 2 Primal Dual Patterns of solutions Cone replacement 30
31 2. ADMM for Primal and Dual Sparse SDPs Cone Decomposition of Sparse SDPs Primal Dual Dual Aggregate sparsity pattern E is union of patterns of C, A 1,..., A m Cone Decomposition A big sparse PSD cone is equivalently replaced by a set of coupled small PSD cones; Our idea: introduce additional variables to decouple the coupling constraints. 31
32 2. ADMM for Primal and Dual Sparse SDPs ADMM for primal SDPs Consensus Reformulate using indicator functions Augmented Lagrangian Regroup the variables 32
33 2. ADMM for Primal and Dual Sparse SDPs ADMM for primal SDPs Consensus 1) Minimization over block X QP with linear constraint (Projections onto a linear subspace) 2) Minimization over block Y Projections onto small PSD cones; Can be computed in parallel. 3) Update multipliers 33
34 2. ADMM for Primal and Dual Sparse SDPs ADMM for dual SDPs Consensus Reformulate using indicator functions Augmented Lagrangian QP with linear constraints Projections in parallel ADMM steps in the dual form are scaled versions of those in the primal form! 34
35 2. ADMM for Primal and Dual Sparse SDPs The Big Picture The duality between the primal and dual SDP is inherited by the decomposed problems by virtue of the duality between Grone s and Agler s theorems. 35
36 3. ADMM for the Homogenous Self-dual Embedding KKT condition Primal Dual Notational simplicity KKT conditions Primal feasible Dual feasible Zero-duality gap 36
37 3. ADMM for the Homogenous Self-dual Embedding The Homogeneous Self-dual Embedding τ, κ: two non-negative and complementary variables Notational simplicity Feasibility problem The big sparse PSD cone has already been equivalently replaced by a set of coupled small PSD cones; 37
38 3. ADMM for the Homogenous Self-dual Embedding ADMM algorithm ADMM steps (similar to the solver SCS [1]) Projection onto a subspace Projection onto cones (smaller dimension) Q is highly structured and sparse Block elimination can be applied here to speed up the projection greatly; Then, the per-iteration cost is the same as applying a splitting method to the primal or dual alone. [1] O Donoghue, B., Chu, E., and Parikh, Nealand Boyd, S. (2016b). Conic optimization via operator splitting and homogeneous self-dual embedding. Journal of Optimization Theory and Applications, 169(3),
39 4. CDCS: Cone Decomposition Conic Solver CDCS An open source MATLAB solver for partially decomposable conic programs; CDCS supports constraints on the following cones: Free variables non-negative orthant second-order cone the positive semidefinite cone. Input-output format is in accordance with SeDuMi; Works with latest Yalmip release. Syntax: [x,y,z,info] = cdcs(at,b,c,k,opts); Download from 39
40 4. CDCS: Cone Decomposition Conic Solver Random SDPs with block-arrow pattern Block size: d, Number of Blocks: l Arrow head: h Number of constraints: m Numerical Comparison SeDuMi SCS sparsecolo (preprocessor) +SeDuMi ε tol = 10 3 CDCS and SCS Numerical Results 40
41 4. CDCS: Cone Decomposition Conic Solver Benchmark problems in SDPLIB [2] Three sets of benchmark problems in SDPLIB (Borchers, 1999): 1) Four small and medium-sized SDPs ( theta1, theta2, qap5 and qap9); 2) Four large-scale sparse SDPs (maxg11, maxg32, qpg11 and qpg51); 3) Two infeasible SDPs (infp1 and infd1). [2] Borchers, Brian. "SDPLIB 1.2, a library of semidefinite programming test problems." Optimization Methods and Software (1999):
42 4. CDCS: Cone Decomposition Conic Solver Result: small and medium-sized instances 42
43 4. CDCS: Cone Decomposition Conic Solver Result: large-sparse instances maxg32: original cone size 2000; after chordal decomposition, maximal size 60; qpg11: original cone size 1600; after chordal decomposition, maximal size 24; 43
44 4. CDCS: Cone Decomposition Conic Solver Result: Infeasible instances 44
45 4. CDCS: Cone Decomposition Conic Solver Result: CPU time per iteration small and medium size large-scale and sparse Work with smaller semidefinite cones for large-scale sparse problems Our codes are currently written in MATLAB SCS is implemented in C. 45
46 5. Conclusion Summary Introduced a conversion framework for sparse SDPs Developed efficient ADMM algorithms Primal and dual standard form; The homogeneous self-dual embedding; suitable for first-order methods; CDCS: Download from Ongoing work Develop ADMM algorithms for sparse SDPs arising in SOS. Applications in networked systems and power systems. 46
47 Thank you for your attention! Q & A
Fast ADMM for Sum of Squares Programs Using Partial Orthogonality
Fast ADMM for Sum of Squares Programs Using Partial Orthogonality Antonis Papachristodoulou Department of Engineering Science University of Oxford www.eng.ox.ac.uk/control/sysos antonis@eng.ox.ac.uk with
More informationExploiting Structure in SDPs with Chordal Sparsity
Exploitig Structure i SDPs with Chordal Sparsity Atois Papachristodoulou Departmet of Egieerig Sciece, Uiversity of Oxford Joit work with Yag Zheg, Giovai Fatuzzi, Paul Goulart ad Adrew Wy CDC 06 Pre-coferece
More informationIII. Applications in convex optimization
III. Applications in convex optimization nonsymmetric interior-point methods partial separability and decomposition partial separability first order methods interior-point methods Conic linear optimization
More informationSparse Matrix Theory and Semidefinite Optimization
Sparse Matrix Theory and Semidefinite Optimization Lieven Vandenberghe Department of Electrical Engineering University of California, Los Angeles Joint work with Martin S. Andersen and Yifan Sun Third
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-284 Research Reports on Mathematical and Computing Sciences Exploiting Sparsity in Linear and Nonlinear Matrix Inequalities via Positive Semidefinite Matrix Completion Sunyoung Kim, Masakazu
More informationParallel implementation of primal-dual interior-point methods for semidefinite programs
Parallel implementation of primal-dual interior-point methods for semidefinite programs Masakazu Kojima, Kazuhide Nakata Katsuki Fujisawa and Makoto Yamashita 3rd Annual McMaster Optimization Conference:
More informationUses of duality. Geoff Gordon & Ryan Tibshirani Optimization /
Uses of duality Geoff Gordon & Ryan Tibshirani Optimization 10-725 / 36-725 1 Remember conjugate functions Given f : R n R, the function is called its conjugate f (y) = max x R n yt x f(x) Conjugates appear
More informationThe Ongoing Development of CSDP
The Ongoing Development of CSDP Brian Borchers Department of Mathematics New Mexico Tech Socorro, NM 87801 borchers@nmt.edu Joseph Young Department of Mathematics New Mexico Tech (Now at Rice University)
More informationarxiv: v1 [math.oc] 26 Sep 2015
arxiv:1509.08021v1 [math.oc] 26 Sep 2015 Degeneracy in Maximal Clique Decomposition for Semidefinite Programs Arvind U. Raghunathan and Andrew V. Knyazev Mitsubishi Electric Research Laboratories 201 Broadway,
More informationDegeneracy in Maximal Clique Decomposition for Semidefinite Programs
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Degeneracy in Maximal Clique Decomposition for Semidefinite Programs Raghunathan, A.U.; Knyazev, A. TR2016-040 July 2016 Abstract Exploiting
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 informationTHe increasing traffic demand in today s life brings a
Platooning of Connected Vehicles with Undirected Topologies: Robustness Analysis and Distributed H-infinity Controller Synthesis Yang Zheng, Shengbo Eben Li, Member, IEEE, Keqiang Li and Wei Ren, Fellow,
More informationIEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 1
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS Platooning of Connected Vehicles With Undirected Topologies: Robustness Analysis and Distributed H-infinity Controller Synthesis Yang Zheng, Student
More informationBehavioral Cooperation of Multiple Connected Vehicles with Directed Acyclic Interactions using Feedforward-Feedback Control
Behavioral Cooperation of Multiple Connected Vehicles with Directed Acyclic Interactions using Feedforward-Feedback Control Yougang Bian, Yang Zheng, Shengbo Eben Li, Qing Xu, Jianqiang Wang,, Keqiang
More informationA CONIC DANTZIG-WOLFE DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING
A CONIC DANTZIG-WOLFE DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING Kartik Krishnan Advanced Optimization Laboratory McMaster University Joint work with Gema Plaza Martinez and Tamás
More informationConvex Optimization of Graph Laplacian Eigenvalues
Convex Optimization of Graph Laplacian Eigenvalues Stephen Boyd Stanford University (Joint work with Persi Diaconis, Arpita Ghosh, Seung-Jean Kim, Sanjay Lall, Pablo Parrilo, Amin Saberi, Jun Sun, Lin
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 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 informationSparse Optimization Lecture: Basic Sparse Optimization Models
Sparse Optimization Lecture: Basic Sparse Optimization Models Instructor: Wotao Yin July 2013 online discussions on piazza.com Those who complete this lecture will know basic l 1, l 2,1, and nuclear-norm
More informationGraph and Controller Design for Disturbance Attenuation in Consensus Networks
203 3th International Conference on Control, Automation and Systems (ICCAS 203) Oct. 20-23, 203 in Kimdaejung Convention Center, Gwangju, Korea Graph and Controller Design for Disturbance Attenuation in
More informationDimension reduction for semidefinite programming
1 / 22 Dimension reduction for semidefinite programming Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
More informationFast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma
Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 8 September 2003 European Union RTN Summer School on Multi-Agent
More informationSMCP Documentation. Release Martin S. Andersen and Lieven Vandenberghe
SMCP Documentation Release 0.4.5 Martin S. Andersen and Lieven Vandenberghe May 18, 2018 Contents 1 Current release 3 2 Future releases 5 3 Availability 7 4 Authors 9 5 Feedback and bug reports 11 5.1
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 informationLecture 14: Optimality Conditions for Conic Problems
EE 227A: Conve Optimization and Applications March 6, 2012 Lecture 14: Optimality Conditions for Conic Problems Lecturer: Laurent El Ghaoui Reading assignment: 5.5 of BV. 14.1 Optimality for Conic Problems
More informationDistributed Model Predictive Control for Heterogeneous Vehicle Platoons under Unidirectional Topologies
Distributed Model Predictive Control for Heterogeneous Vehicle Platoons under Unidirectional Topologies Yang Zheng, Shengbo Eben Li, Keqiang Li, Francesco Borrelli, and J. Karl Hedrick Abstract This paper
More informationAlgorithm-Hardware Co-Optimization of Memristor-Based Framework for Solving SOCP and Homogeneous QCQP Problems
L.C.Smith College of Engineering and Computer Science Algorithm-Hardware Co-Optimization of Memristor-Based Framework for Solving SOCP and Homogeneous QCQP Problems Ao Ren Sijia Liu Ruizhe Cai Wujie Wen
More informationConvex Optimization of Graph Laplacian Eigenvalues
Convex Optimization of Graph Laplacian Eigenvalues Stephen Boyd Abstract. We consider the problem of choosing the edge weights of an undirected graph so as to maximize or minimize some function of the
More informationSemidefinite Programming, Combinatorial Optimization and Real Algebraic Geometry
Semidefinite Programming, Combinatorial Optimization and Real Algebraic Geometry assoc. prof., Ph.D. 1 1 UNM - Faculty of information studies Edinburgh, 16. September 2014 Outline Introduction Definition
More informationOptimal Network Topology Design in Multi-Agent Systems for Efficient Average Consensus
49th IEEE Conference on Decision and Control December 15-17, 010 Hilton Atlanta Hotel, Atlanta, GA, USA Optimal Network Topology Design in Multi-Agent Systems for Efficient Average Consensus Mohammad Rafiee
More informationCSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming
More informationAnalysis and synthesis: a complexity perspective
Analysis and synthesis: a complexity perspective Pablo A. Parrilo ETH ZürichZ control.ee.ethz.ch/~parrilo Outline System analysis/design Formal and informal methods SOS/SDP techniques and applications
More information2 Regularized Image Reconstruction for Compressive Imaging and Beyond
EE 367 / CS 448I Computational Imaging and Display Notes: Compressive Imaging and Regularized Image Reconstruction (lecture ) Gordon Wetzstein gordon.wetzstein@stanford.edu This document serves as a supplement
More informationA PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS IN POLYNOMIAL OPTIMIZATION
A PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS IN POLYNOMIAL OPTIMIZATION Kartik K. Sivaramakrishnan Department of Mathematics North Carolina State University
More informationOn the Scalability in Cooperative Control. Zhongkui Li. Peking University
On the Scalability in Cooperative Control Zhongkui Li Email: zhongkli@pku.edu.cn Peking University June 25, 2016 Zhongkui Li (PKU) Scalability June 25, 2016 1 / 28 Background Cooperative control is to
More informationEquivalent relaxations of optimal power flow
Equivalent relaxations of optimal power flow 1 Subhonmesh Bose 1, Steven H. Low 2,1, Thanchanok Teeraratkul 1, Babak Hassibi 1 1 Electrical Engineering, 2 Computational and Mathematical Sciences California
More informationALADIN An Algorithm for Distributed Non-Convex Optimization and Control
ALADIN An Algorithm for Distributed Non-Convex Optimization and Control Boris Houska, Yuning Jiang, Janick Frasch, Rien Quirynen, Dimitris Kouzoupis, Moritz Diehl ShanghaiTech University, University of
More information4. Algebra and Duality
4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone
More informationFast Linear Iterations for Distributed Averaging 1
Fast Linear Iterations for Distributed Averaging 1 Lin Xiao Stephen Boyd Information Systems Laboratory, Stanford University Stanford, CA 943-91 lxiao@stanford.edu, boyd@stanford.edu Abstract We consider
More informationA CONIC INTERIOR POINT DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING
A CONIC INTERIOR POINT DECOMPOSITION APPROACH FOR LARGE SCALE SEMIDEFINITE PROGRAMMING Kartik Krishnan Sivaramakrishnan Department of Mathematics NC State University kksivara@ncsu.edu http://www4.ncsu.edu/
More informationRobust and Optimal Control, Spring 2015
Robust and Optimal Control, Spring 2015 Instructor: Prof. Masayuki Fujita (S5-303B) G. Sum of Squares (SOS) G.1 SOS Program: SOS/PSD and SDP G.2 Duality, valid ineqalities and Cone G.3 Feasibility/Optimization
More informationPreconditioning via Diagonal Scaling
Preconditioning via Diagonal Scaling Reza Takapoui Hamid Javadi June 4, 2014 1 Introduction Interior point methods solve small to medium sized problems to high accuracy in a reasonable amount of time.
More informationAsynchronous Algorithms for Conic Programs, including Optimal, Infeasible, and Unbounded Ones
Asynchronous Algorithms for Conic Programs, including Optimal, Infeasible, and Unbounded Ones Wotao Yin joint: Fei Feng, Robert Hannah, Yanli Liu, Ernest Ryu (UCLA, Math) DIMACS: Distributed Optimization,
More informationVarious Techniques for Nonlinear Energy-Related Optimizations. Javad Lavaei. Department of Electrical Engineering Columbia University
Various Techniques for Nonlinear Energy-Related Optimizations Javad Lavaei Department of Electrical Engineering Columbia University Acknowledgements Caltech: Steven Low, Somayeh Sojoudi Columbia University:
More informationA New Use of Douglas-Rachford Splitting and ADMM for Classifying Infeasible, Unbounded, and Pathological Conic Programs
A New Use of Douglas-Rachford Splitting and ADMM for Classifying Infeasible, Unbounded, and Pathological Conic Programs Yanli Liu, Ernest K. Ryu, and Wotao Yin May 23, 2017 Abstract In this paper, we present
More informationOn Optimal Frame Conditioners
On Optimal Frame Conditioners Chae A. Clark Department of Mathematics University of Maryland, College Park Email: cclark18@math.umd.edu Kasso A. Okoudjou Department of Mathematics University of Maryland,
More informationPENNON A Generalized Augmented Lagrangian Method for Convex NLP and SDP p.1/39
PENNON A Generalized Augmented Lagrangian Method for Convex NLP and SDP Michal Kočvara Institute of Information Theory and Automation Academy of Sciences of the Czech Republic and Czech Technical University
More informationDual methods and ADMM. Barnabas Poczos & Ryan Tibshirani Convex Optimization /36-725
Dual methods and ADMM Barnabas Poczos & Ryan Tibshirani Convex Optimization 10-725/36-725 1 Given f : R n R, the function is called its conjugate Recall conjugate functions f (y) = max x R n yt x f(x)
More information6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC
6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC 2003 2003.09.02.10 6. The Positivstellensatz Basic semialgebraic sets Semialgebraic sets Tarski-Seidenberg and quantifier elimination Feasibility
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 informationLecture 14: Random Walks, Local Graph Clustering, Linear Programming
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 14: Random Walks, Local Graph Clustering, Linear Programming Lecturer: Shayan Oveis Gharan 3/01/17 Scribe: Laura Vonessen Disclaimer: These
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More informationMULTI-AGENT TRACKING OF A HIGH-DIMENSIONAL ACTIVE LEADER WITH SWITCHING TOPOLOGY
Jrl Syst Sci & Complexity (2009) 22: 722 731 MULTI-AGENT TRACKING OF A HIGH-DIMENSIONAL ACTIVE LEADER WITH SWITCHING TOPOLOGY Yiguang HONG Xiaoli WANG Received: 11 May 2009 / Revised: 16 June 2009 c 2009
More informationIntroduction to Alternating Direction Method of Multipliers
Introduction to Alternating Direction Method of Multipliers Yale Chang Machine Learning Group Meeting September 29, 2016 Yale Chang (Machine Learning Group Meeting) Introduction to Alternating Direction
More informationExplicit Sensor Network Localization using Semidefinite Programming and Clique Reductions
Explicit Sensor Network Localization using Semidefinite Programming and Clique Reductions Nathan Krislock and Henry Wolkowicz Dept. of Combinatorics and Optimization University of Waterloo Haifa Matrix
More informationm i=1 c ix i i=1 F ix i F 0, X O.
What is SDP? for a beginner of SDP Copyright C 2005 SDPA Project 1 Introduction This note is a short course for SemiDefinite Programming s SDP beginners. SDP has various applications in, for example, control
More informationSemidefinite Optimization using MOSEK
Semidefinite Optimization using MOSEK Joachim Dahl ISMP Berlin, August 23, 2012 http://www.mose.com Introduction Introduction Semidefinite optimization Algorithms Results and examples Summary MOSEK is
More informationDecentralized Stabilization of Heterogeneous Linear Multi-Agent Systems
1 Decentralized Stabilization of Heterogeneous Linear Multi-Agent Systems Mauro Franceschelli, Andrea Gasparri, Alessandro Giua, and Giovanni Ulivi Abstract In this paper the formation stabilization problem
More informationA PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS
A PARALLEL INTERIOR POINT DECOMPOSITION ALGORITHM FOR BLOCK-ANGULAR SEMIDEFINITE PROGRAMS Kartik K. Sivaramakrishnan Department of Mathematics North Carolina State University kksivara@ncsu.edu http://www4.ncsu.edu/
More informationContinuous Optimisation, Chpt 9: Semidefinite Problems
Continuous Optimisation, Chpt 9: Semidefinite Problems Peter J.C. Dickinson DMMP, University of Twente p.j.c.dickinson@utwente.nl http://dickinson.website/teaching/2016co.html version: 21/11/16 Monday
More informationSDPARA : SemiDefinite Programming Algorithm PARAllel version
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
More informationStochastic dynamical modeling:
Stochastic dynamical modeling: Structured matrix completion of partially available statistics Armin Zare www-bcf.usc.edu/ arminzar Joint work with: Yongxin Chen Mihailo R. Jovanovic Tryphon T. Georgiou
More informationEE C128 / ME C134 Feedback Control Systems
EE C128 / ME C134 Feedback Control Systems Lecture Additional Material Introduction to Model Predictive Control Maximilian Balandat Department of Electrical Engineering & Computer Science University of
More informationSemidefinite Programming
Semidefinite Programming Basics and SOS Fernando Mário de Oliveira Filho Campos do Jordão, 2 November 23 Available at: www.ime.usp.br/~fmario under talks Conic programming V is a real vector space h, i
More informationSparsity-Promoting Optimal Control of Distributed Systems
Sparsity-Promoting Optimal Control of Distributed Systems Mihailo Jovanović www.umn.edu/ mihailo joint work with: Makan Fardad Fu Lin LIDS Seminar, MIT; Nov 6, 2012 wind farms raft APPLICATIONS: micro-cantilevers
More informationLecture 7: Convex Optimizations
Lecture 7: Convex Optimizations Radu Balan, David Levermore March 29, 2018 Convex Sets. Convex Functions A set S R n is called a convex set if for any points x, y S the line segment [x, y] := {tx + (1
More informationResearch overview. Seminar September 4, Lehigh University Department of Industrial & Systems Engineering. Research overview.
Research overview Lehigh University Department of Industrial & Systems Engineering COR@L Seminar September 4, 2008 1 Duality without regularity condition Duality in non-exact arithmetic 2 interior point
More information15-780: LinearProgramming
15-780: LinearProgramming J. Zico Kolter February 1-3, 2016 1 Outline Introduction Some linear algebra review Linear programming Simplex algorithm Duality and dual simplex 2 Outline Introduction Some linear
More informationSolving large Semidefinite Programs - Part 1 and 2
Solving large Semidefinite Programs - Part 1 and 2 Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria F. Rendl, Singapore workshop 2006 p.1/34 Overview Limits of Interior
More informationThe maximal stable set problem : Copositive programming and Semidefinite Relaxations
The maximal stable set problem : Copositive programming and Semidefinite Relaxations Kartik Krishnan Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy, NY 12180 USA kartis@rpi.edu
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 informationReducing Time Headway for Platoons of Connected Vehicles via Multiple-Predecessor Following
018 1st International Conference on Intelligent Transportation Systems ITSC Maui, Hawaii, USA, November 4-7, 018 Reducing Time Headway for Platoons of Connected Vehicles via Multiple-Predecessor Following
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 informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationAverage-Consensus of Multi-Agent Systems with Direct Topology Based on Event-Triggered Control
Outline Background Preliminaries Consensus Numerical simulations Conclusions Average-Consensus of Multi-Agent Systems with Direct Topology Based on Event-Triggered Control Email: lzhx@nankai.edu.cn, chenzq@nankai.edu.cn
More informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
More informationHow to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization
CS-11-01 How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization Hayato Waki Department of Computer Science, The University of Electro-Communications
More informationNumerical Methods I Non-Square and Sparse Linear Systems
Numerical Methods I Non-Square and Sparse Linear Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 25th, 2014 A. Donev (Courant
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 informationThe moment-lp and moment-sos approaches
The moment-lp and moment-sos approaches LAAS-CNRS and Institute of Mathematics, Toulouse, France CIRM, November 2013 Semidefinite Programming Why polynomial optimization? LP- and SDP- CERTIFICATES of POSITIVITY
More informationA Customized ADMM for Rank-Constrained Optimization Problems with Approximate Formulations
A Customized ADMM for Rank-Constrained Optimization Problems with Approximate Formulations Chuangchuang Sun and Ran Dai Abstract This paper proposes a customized Alternating Direction Method of Multipliers
More informationA Julia JuMP-based module for polynomial optimization with complex variables applied to ACOPF
JuMP-dev workshop 018 A Julia JuMP-based module for polynomial optimization with complex variables applied to ACOPF Gilles Bareilles, Manuel Ruiz, Julie Sliwak 1. MathProgComplex.jl: A toolbox for Polynomial
More informationHomework 5 ADMM, Primal-dual interior point Dual Theory, Dual ascent
Homework 5 ADMM, Primal-dual interior point Dual Theory, Dual ascent CMU 10-725/36-725: Convex Optimization (Fall 2017) OUT: Nov 4 DUE: Nov 18, 11:59 PM START HERE: Instructions Collaboration policy: Collaboration
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 information18. Primal-dual interior-point methods
L. Vandenberghe EE236C (Spring 213-14) 18. Primal-dual interior-point methods primal-dual central path equations infeasible primal-dual method primal-dual method for self-dual embedding 18-1 Symmetric
More informationSparse quadratic regulator
213 European Control Conference ECC) July 17-19, 213, Zürich, Switzerland. Sparse quadratic regulator Mihailo R. Jovanović and Fu Lin Abstract We consider a control design problem aimed at balancing quadratic
More informationInfeasibility detection in the alternating direction method of multipliers for convex optimization
Infeasibility detection in the alternating direction method of multipliers for convex optimization Goran Banjac, Paul Goulart, Bartolomeo Stellato, and Stephen Boyd June 20, 208 Abstract The alternating
More informationLow-ranksemidefiniteprogrammingforthe. MAX2SAT problem. Bosch Center for Artificial Intelligence
Low-ranksemidefiniteprogrammingforthe MAX2SAT problem Po-Wei Wang J. Zico Kolter Machine Learning Department Carnegie Mellon University School of Computer Science, Carnegie Mellon University, and Bosch
More informationCS6375: Machine Learning Gautam Kunapuli. Support Vector Machines
Gautam Kunapuli Example: Text Categorization Example: Develop a model to classify news stories into various categories based on their content. sports politics Use the bag-of-words representation for this
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 informationLecture 5. Theorems of Alternatives and Self-Dual Embedding
IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual 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 informationSPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
Journal of the Operations Research Society of Japan 2008, Vol. 51, No. 3, 241-264 SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS Kazuhiro Kobayashi Sunyoung Kim Masakazu
More informationDual Ascent. Ryan Tibshirani Convex Optimization
Dual Ascent Ryan Tibshirani Conve Optimization 10-725 Last time: coordinate descent Consider the problem min f() where f() = g() + n i=1 h i( i ), with g conve and differentiable and each h i conve. Coordinate
More informationModule 04 Optimization Problems KKT Conditions & Solvers
Module 04 Optimization Problems KKT Conditions & Solvers Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September
More informationA direct formulation for sparse PCA using semidefinite programming
A direct formulation for sparse PCA using semidefinite programming A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley A. d Aspremont, INFORMS, Denver,
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 02: Optimization (Convex and Otherwise) What is Optimization? An Optimization Problem has 3 parts. x F f(x) :
More informationAlternating Direction Method of Multipliers. Ryan Tibshirani Convex Optimization
Alternating Direction Method of Multipliers Ryan Tibshirani Convex Optimization 10-725 Consider the problem Last time: dual ascent min x f(x) subject to Ax = b where f is strictly convex and closed. Denote
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 informationSparse Optimization Lecture: Dual Certificate in l 1 Minimization
Sparse Optimization Lecture: Dual Certificate in l 1 Minimization Instructor: Wotao Yin July 2013 Note scriber: Zheng Sun Those who complete this lecture will know what is a dual certificate for l 1 minimization
More informationStrange Behaviors of Interior-point Methods. for Solving Semidefinite Programming Problems. in Polynomial Optimization
CS-08-02 Strange Behaviors of Interior-point Methods for Solving Semidefinite Programming Problems in Polynomial Optimization Hayato Waki, Maho Nakata, and Masakazu Muramatsu Department of Computer Science,
More information