A method based on parametric convex programming for solving convex multiplicative programming problem
We propose a new parametric approach to convex multiplicative programming problem. This problem is nonconvex optimization problem with a lot of practical applications. Compared with preceding methods based on branch-and-bound procedure and other ...
Packing spheres with quasi-containment conditions
A novel sphere packing problem is introduced. A maximum number of spheres of different radii should be placed such that the spheres do not overlap and their centers fulfill a quasi-containment condition. The latter allows the spheres to lie ...
Curvature-constrained Steiner networks with three terminals
A procedure is presented for finding the shortest network connecting three given undirected points, subject to a curvature constraint on both the path joining two of the points and the path that connects to the third point. The problem is a ...
Modified general splitting method for the split feasibility problem
Based on the equivalent optimization problems of the splitting feasibility problem, we investigate this problem by using modified general splitting method in this paper. One is a relaxation splitting method with linearization, and the other ...
A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression
A large family of paradigmatic models arising in the area of image/signal processing, machine learning and statistics regression can be boiled down to consensus optimization. This paper is devoted to a class of consensus optimization by ...
A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming
We present a proximal point type algorithm tailored for tackling pseudomonotone equilibrium problems in a Hilbert space which are not necessarily convex in the second argument of the involved bifunction. Motivated by the extragradient algorithm, ...
Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
In this paper, we consider a polynomial problem with equilibrium constraints in which the constraint functions and the equilibrium constraints involve data uncertainties. Employing a robust optimization approach, we examine the uncertain ...