Results 61 to 70 of about 836,294 (206)
Approximating Semidefinite Packing Programs [PDF]
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications such as semidefinite programming relaxations for combinatorial optimization problems, sparse principal component analysis, and sparse variance unfolding techniques for dimension ...
Garud Iyengar +2 more
openaire +2 more sources
Linear semidefinite programming problems: regularisation and strong dual formulations
Regularisation consists in reducing a given optimisation problem to an equivalent form where certain regularity conditions, which guarantee the strong duality, are fulfilled.
Olga I. Kostyukova +1 more
doaj +1 more source
Computing Skinning Weights via Convex Duality
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
A Method for Semidefinite Quasiconvex Maximization Problem
We introduce so-called semidefinite quasiconvex maximization problem. We derive new global optimality conditions by generalizing [9]. Using these conditions, we construct an algorithm which generates a sequence of local maximizers that converges to a ...
R. Enkhbat +3 more
doaj
On the Solution of a Nonlinear Semidefinite Program Arising in Discrete-Time Feedback Control Design
A sequential quadratic programming method with line search is analyzed and studied for finding the local solution of a nonlinear semidefinite programming problem resulting from the discrete-time output feedback problem.
El-Sayed M. E. Mostafa
doaj +1 more source
The Story(line) So Far: A Survey on Storyline Visualization
Abstract Storyline visualizations model narratives as temporal networks, using x‐monotone lines to represent entities and their interactions over time. This technique offers an intuitive way to reveal structural patterns over time, such as character co‐occurrence and narrative flow.
S. Di Bartolomeo +4 more
wiley +1 more source
Recently, there has been significant interest in filter methods for solving nonlinear problems. Extensions of these methods to nonlinear semidefinite programming (NLSDP) problems are described.
Dandan Li, Songhua Wang
doaj +1 more source
SDP Relaxation Methods for RSS/AOA-Based Localization in Sensor Networks
With the fast development of new array technology and intelligent antenna, it is easier to obtain angle of arrival (AOA) measurements. Hybrid received signal strength (RSS) and AOA measurement techniques are proposed for the position computing in sensor ...
Hengnian Qi, Lufeng Mo, Xiaoping Wu
doaj +1 more source
Cubical coloring — fractional covering by cuts and semidefinite programming [PDF]
We introduce a new graph parameter that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings.
Robert Šámal
doaj +1 more source
A Splitting Architecture for Exact Reduced Coulomb Friction
Abstract Existing approaches to frictional contact dynamics typically either modify the Coulomb law to improve numerical robustness or solve the exact law in a fully coupled monolithic form. However, in its reduced form, exact Coulomb friction can be written as a cone complementarity problem with an augmented velocity, which reveals a natural split ...
Hongcheng Song +3 more
wiley +1 more source

