Results 91 to 100 of about 2,134,101 (207)
Convex Optimization Via Feedbacks
Summary: Three dynamical systems are associated with a problem of convex optimization in a finite-dimensional space. For system trajectories \( x(t) \), the ratios \( x(t)/t \) are, respectively, (i) solution tracking (staying within the solution set \( X^0 \)), (ii) solution abandoning (reaching \( X^0 \) as time \( t \) goes back to the initial ...
openaire +5 more sources
Hidden Convexity in Partially Separable Optimization [PDF]
The paper identifies classes of nonconvex optimization problems whose convex relaxations have optimal solutions which at the same time are global optimal solutions of the original nonconvex problems. Such a hidden convexity property was so far limited to
Laurent, M., Ben-Tal, A., Hertog, D. den
core
RSS-TOA based localization algorithm in non-line-of-sight environment
The existence of non-line-of-sight (NLOS) error can degrade the positioning performance in wireless sensor network localization system,especially in indoor localization.To overcome the localization error caused by NLOS propagation,a localization ...
Zhigang LU +4 more
doaj +2 more sources
Investment Optimization under Constraints [PDF]
We analyze general stochastic optimization financial problems under constraints in a general framework, which includes financial models with some ``imperfection'', such as constrained portfolios, labor income, random endowment and large investor models ...
Long Nguyen-Thanh
core
Random gradient-free minimization of convex functions [PDF]
In this paper, we prove the complexity bounds for methods of Convex Optimization based only on computation of the function value. The search directions of our schemes are normally distributed random Gaussian vectors.
NESTEROV, Yurii
core
Convex Functions on a Normed Linear Space
Convex functions and their relatives are ubiquitous in a large variety of applications such as optimization theory, mass transportation, mathematical economics, and geometric inequalities related to isoperimetric problems.
Lars-Erik Persson +3 more
core +1 more source
A D-induced duality and its applications [PDF]
This paper attempts to extend the notion of duality for convex cones, by basing it on a predescribed conic ordering and a fixed bilinear mapping. This is an extension of the standard definition of dual cones, in the sense that the nonnegativity of the ...
Zhang, S., Brinkhuis, J.
core +2 more sources
On a conic approach to convex analysis. [PDF]
. The aim of this paper is to make an attempt to justify the main results from Convex Analysis by one elegant tool, the conification method, which consists of three steps: conify, work with convex cones, deconify.
Brinkhuis, J.
core
A Simplified Convex Optimization Model for Image Restoration with Multiplicative Noise. [PDF]
Che H, Tang Y.
europepmc +1 more source
Matrix convex functions with applications to weighted centers for semidefinite programming [PDF]
In this paper, we develop various calculus rules for general smooth matrix-valued functions and for the class of matrix convex (or concave) functions first introduced by Loewner and Kraus in 1930s.
Zhang, S., Luo, Z-Q., Brinkhuis, J.
core

