Results 131 to 140 of about 80,113 (167)

Relaxed robust second-order-cone programming

Applied Mathematics and Computation, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Averbakh, I., Zhao, Y. B.
openaire   +2 more sources

Smoothing Functions for Second-Order-Cone Complementarity Problems

SIAM Journal on Optimization, 2002
The paper presents an alternative interior point approach for the nonlinear complementarity problem. The main interest of the results are in the area of optimization problems with Second Order Cone (SOC) constraints in \(\mathbb{R}^n\), \(n\geq 1\), the Lorentz cone. The usual problem is reformulated as a semidefinite cone constraints plus a constraint
Fukushima, Masao, Luo, Zhi-Quan, Tseng, Paul   +2 more
openaire   +1 more source

On Polyhedral Approximations of the Second-Order Cone

Mathematics of Operations Research, 2001
We demonstrate that a conic quadratic problem, [Formula: see text] is “polynomially reducible” to Linear Programming. We demonstrate this by constructing, for every ϵ ∈ (0, ½], an LP program (explicitly given in terms of ϵ and the data of (CQP)) [Formula: see text] with the following properties: the number dim x + dim u of variables and the number dim
Ben-Tal, Aharon, Nemirovski, Arkadi
openaire   +2 more sources

Two-dimensional Second-Order Cone Programming

International Journal of Operational Research, 2009
We show that the primal and dual 2-dimensional second-order cone programs in standard form are equivalent to the standard-form primal and dual linear programs via a linear transformation. We show how variables in the Second-Order Cone (SOC) programs and the linear programs are related by the transformation. Based on the transformation, we interpret the
openaire   +1 more source

Second-Order Optimality Conditions for Multiobjective Optimization Whose Order Induced by Second-Order Cone

Journal of the Operations Research Society of China, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Li-Wei, Zhang, Ji-Hong, Zhang, Yu-Le   +2 more
openaire   +2 more sources

Quadratic, Semidefinite, and Second-Order Cone Programming

2021
Quadratic programming (QP) is a family of methods, techniques, and algorithms that can be used to minimize quadratic objective functions subject to linear constraints. QP shares many combinatorial features with linear programming (LP) and it is often used as the basis of constrained nonlinear programming.
Andreas Antoniou, Wu-Sheng Lu
openaire   +1 more source

Positive maps of second-order cones

Linear and Multilinear Algebra, 2007
Let and let be the n-dimensional second-order cone, or Lorentz cone. A linear map M from to is called positive if M[Lm]⊂Ln . The set of positive maps forms a convex cone, the positive cone. Its dual cone, the separable cone, is the convex hull of tensor products x⊗y, where x∈Ln , y∈Lm .
openaire   +2 more sources

The second-order cone eigenvalue complementarity problem

Optimization Methods and Software, 2015
The eigenvalue complementarity problem EiCP differs from the traditional eigenvalue problem in that the primal and dual variables belong to a closed and convex cone K and its dual, respectively, and satisfy a complementarity condition. In this paper we investigate the solution of the second-order cone EiCP SOCEiCP where K is the Lorentz cone.
Luís M. Fernandes, Masao Fukushima, Joaquim J. Júdice, Hanif D. Sherali   +3 more
openaire   +1 more source

Link Prediction via Second Order Cone Programming

Proceedings of the 10th ACM Conference on Web Science, 2019
Link Prediction has emerged as an important problem with the recent interest in studying large scale social graphs. User interactions on social networks can be represented as signed directed graphs where the links represent nature of their relation. Positive links correspond to trust/friendship among nodes.
Shreya Malani, Dinesh Dileep Gaurav, Rahul Agrawal   +2 more
openaire   +1 more source

Second‐order cone programming formulation of discontinuous deformation analysis

International Journal for Numerical Methods in Engineering, 2019
SummaryIn classic discontinuous deformation analysis (DDA), artificial springs must be employed to enforce the contact condition through the open‐close iteration. However, improper stiffness parameters might cause numerical problems. The main goal of this paper is to propose a new framework of DDA using second‐order cone programming.
Jingjing Meng, Ping Cao, Jinsong Huang, Hang Lin, Yu Chen, Rihong Cao   +5 more
openaire   +2 more sources