A feasible direction algorithm for general nonlinear semidefinite programming
Sign Up to like & getrecommendations! Published in 2017 at "Structural and Multidisciplinary Optimization"
DOI: 10.1007/s00158-016-1564-5
Abstract: This paper deals with nonlinear smooth optimization problems with equality and inequality constraints, as well as semidefinite constraints on nonlinear symmetric matrix-valued functions. A new semidefinite programming algorithm that takes advantage of the structure of… read more here.
Keywords: direction; semidefinite programming; direction algorithm; optimization ... See more keywords
Exact augmented Lagrangian functions for nonlinear semidefinite programming
Sign Up to like & getrecommendations! Published in 2018 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-018-0017-z
Abstract: In this paper, we study augmented Lagrangian functions for nonlinear semidefinite programming (NSDP) problems with exactness properties. The term exact is used in the sense that the penalty parameter can be taken appropriately, so a… read more here.
Keywords: programming; functions nonlinear; semidefinite programming; nonlinear semidefinite ... See more keywords
T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
Sign Up to like & getrecommendations! Published in 2021 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-020-00231-w
Abstract: The T-product for third-order tensors has been used extensively in the literature. In this paper, we first introduce first-order and second-order T-derivatives for the multi-variable real-valued function with the tensor T-product. Inspired by an equivalent… read more here.
Keywords: order; third order; symmetric tensors; positive semidefiniteness ... See more keywords
Uniqueness of codes using semidefinite programming
Sign Up to like & getrecommendations! Published in 2019 at "Designs, Codes, and Cryptography"
DOI: 10.1007/s10623-018-0589-8
Abstract: For $$n,d,w \in \mathbb {N}$$n,d,w∈N, let A(n, d, w) denote the maximum size of a binary code of word length n, minimum distance d and constant weight w. Schrijver recently showed using semidefinite programming that $$A(23,8,11)=1288$$A(23,8,11)=1288, and the second author that $$A(22,8,11)=672$$A(22,8,11)=672 and $$A(22,8,10)=616$$A(22,8,10)=616.… read more here.
Keywords: uniqueness codes; using semidefinite; codes using; semidefinite programming ... See more keywords
Adaptive grid semidefinite programming for finding optimal designs
Sign Up to like & getrecommendations! Published in 2018 at "Statistics and Computing"
DOI: 10.1007/s11222-017-9741-y
Abstract: We find optimal designs for linear models using a novel algorithm that iteratively combines a semidefinite programming (SDP) approach with adaptive grid techniques. The proposed algorithm is also adapted to find locally optimal designs for… read more here.
Keywords: semidefinite programming; find optimal; adaptive grid; proposed algorithm ... See more keywords
A proximal augmented method for semidefinite programming problems
Sign Up to like & getrecommendations! Published in 2021 at "Applied Numerical Mathematics"
DOI: 10.1016/j.apnum.2021.07.007
Abstract: Abstract A proximal augmented method for solving semidefinite programs is introduced. This method is based on the Augmented Lagrangian method. We study the theoretical properties and show the convergence of the new approach under weaker… read more here.
Keywords: proximal augmented; programming problems; method semidefinite; semidefinite programming ... See more keywords
Converging outer approximations to global attractors using semidefinite programming
Sign Up to like & getrecommendations! Published in 2021 at "Automatica"
DOI: 10.1016/j.automatica.2021.109900
Abstract: This paper develops a method for obtaining guaranteed outer approximations for global attractors of continuous and discrete time nonlinear dynamical systems. The method is based on a hierarchy of semidefinite programming problems of increasing size… read more here.
Keywords: semidefinite programming; global attractor; global attractors; outer approximations ... See more keywords
An Advanced Measurement Placement Method for Power System Observability Using Semidefinite Programming
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Systems Journal"
DOI: 10.1109/jsyst.2017.2688470
Abstract: This paper presents an advanced method for joint placement of unsynchronized conventional measurements and synchronized phasorial measurements in unobservable power systems. Observability checking and determination of maximal observable islands are carried out either by a… read more here.
Keywords: semidefinite programming; system; method; power ... See more keywords
Semidefinite Programming for Wireless Cooperative Localization Using Biased RSS Measurements
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2022.3166780
Abstract: Cooperative localization in wireless sensor network (WSN) using biased received signal strength (RSS) measurements is investigated in this letter. In the existing work on cooperative RSS localization, measurements of sensor nodes (including both target-anchor and… read more here.
Keywords: localization; rss measurements; using biased; semidefinite programming ... See more keywords
Estimating Odometry Scale and UWB Anchor Location Based on Semidefinite Programming Optimization
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Robotics and Automation Letters"
DOI: 10.1109/lra.2022.3182110
Abstract: In this letter, we study the problem of estimating the unknown metric scale of an odometry system and the 3D location of an Ultra-wideband (UWB) anchor in the environment. Firstly, we present a theoretical analysis… read more here.
Keywords: uwb anchor; odometry; scale; location ... See more keywords
Semidefinite Programming Solutions for Elliptic Localization in Asynchronous Radar Networks
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Aerospace and Electronic Systems"
DOI: 10.1109/taes.2022.3149855
Abstract: In this article, semidefinite programming (SDP) solutions are proposed for the elliptic localization problem in asynchronous radar networks, where the transmitters are subject to clock offsets. Relaxing the nonconvex problem into different convex forms, we… read more here.
Keywords: problem; radar networks; elliptic localization; asynchronous radar ... See more keywords