Results 61 to 70 of about 6,081 (225)
LIGHTWEIGHT DESIGN OF STRUCTURES BASED ON A SEMIDEFINITE PROGRAMMING METHOD (MT)
A semidefinite programming-based optimization method is proposed for lightweight design of boom and stay bars of container cranes. The boom and stay bars are welded together by steel plates, and in engineering practices the cross-sectional dimensions of ...
WANG XingFeng +3 more
doaj
Sparse Minimum Redundancy Maximum Relevance for Feature Selection
ABSTRACT We propose a feature screening method that integrates both feature–feature and feature–target relationships. Inactive features are identified via a penalized minimum Redundancy Maximum Relevance (mRMR) procedure, which is the continuous version of the classical mRMR penalized by a non‐convex regularizer, and where the parameters estimated as ...
Peter Naylor +3 more
wiley +1 more source
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
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar +3 more
wiley +1 more source
HDSDP: Software for Semidefinite Programming
HDSDP is a numerical software solving the semidefinite programming problems. The main framework of HDSDP resembles the dual-scaling interior point solver DSDP [BY2008] and several new features, including a dual method based on the simplified homogeneous self-dual embedding, have been implemented.
Wenzhi Gao, Dongdong Ge, Yinyu Ye 0001
openaire +2 more sources
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
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
Measured‐State Conditioned Recursive Feasibility for Stochastic Model Predictive Control
ABSTRACT In this paper, we address the problem of designing stochastic model predictive control (SMPC) schemes for linear systems affected by unbounded disturbances. The contribution of the paper is rooted in a measured‐state initialization strategy. First, due to the nonzero probability of violating chance‐constraints in the case of unbounded noise ...
Mirko Fiacchini +2 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

