An ADMM-based heuristic algorithm for optimization problems over nonconvex second-order cone
Open Computer ScienceThe nonconvex second-order cone (nonconvex SOC) is a nonconvex extension to the convex second-order cone, in the sense that it consists of any vector divided into two sub-vectors for which the Euclidean norm of the first sub-vector is at least as large ...
Alzalg Baha, Benakkouche Lilia
doaj +1 more source
A new branch and bound algorithm for minimax ratios problems
Open Mathematics, 2017 This study presents an efficient branch and bound algorithm for globally solving the minimax fractional programming problem (MFP). By introducing an auxiliary variable, an equivalent problem is firstly constructed and the convex relaxation programming ...
Zhao Yingfeng, Liu Sanyang, Jiao Hongwei
doaj +1 more source
A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
Results in Applied Mathematics, 2019 For the problem of sparse recovery, it is widely accepted that nonconvex minimizations are better than ℓ1 penalty in enhancing the sparsity of solution.
Hoang Tran, Clayton Webster
doaj +1 more source
Solution for the system of generalized nonlinear mixed variational inequality problems
Demonstratio MathematicaWe propose in this paper a class of generalized nonlinear mixed variational inequality problems on Banach spaces, which is composed of three elliptic generalized nonlinear mixed variational inequality problems.
Gissy Hussain +2 more
doaj +1 more source
Sufficient pruning conditions for MINLP in gas network design
EURO Journal on Computational Optimization, 2017 One-quarter of Europe’s energy demand is provided by natural gas distributed through a vast pipeline network covering the whole of Europe. At a cost of 1 million Euros per kilometer the extension of the European pipeline network is already a multi ...
Jesco Humpola, Felipe Serrano
doaj +1 more source
Bounded lower subdifferentiability optimization techniques: applications
, 2009 Lipschitz and quasiconvex programming, Global optimization, Cutting angle method, Abstract convexity, 90C26, 90C30,
Albert Ferrer, Gleb Beliakov
core +1 more source
An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions
EURO Journal on Computational Optimization, 2016 We propose a forward–backward proximal-type algorithm with inertial/memory effects for minimizing the sum of a nonsmooth function with a smooth one in the nonconvex setting.
Radu Ioan Boţ +2 more
doaj +1 more source
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
, 2010 Bi-quadratic optimization, Semidefinite programming relaxation, Approximation solution, Probabilistic solution, 15A69, 90C22, 90C26, 90C59,
Liqun Qi, Chen Ling, Xinzhen Zhang
core +1 more source
Multiplicity theorems involving functions with non-convex range
, 2023 Here is a sample of the results proved in this paper. Mathematics Subject Classification (2010): 49J35, 34B10, 41A50, 41A55, 90C26. Received 03 May 2022; Revised 09 September 2022. Published Online: 2023-03-20.
RICCERI, Biagio, Biagio Ricceri
core +1 more source
On a theorem due to Crouzeix and Ferland
, 2010 Nonsmooth analysis, Nonsmooth optimization, Generalized convexity, KT pseudoconvex problems, FJ pseudoconvex problems, Quasiconvex programming, 90C26, 26B25, 49J52,
Vsevolod Ivanov, Vsevolod I. Ivanov
core +1 more source