Results 41 to 50 of about 3,006 (163)

Optimal Power Flow for radial and mesh grids using semidefinite programming

TecnoLógicas, 2017
This paper presents a convex formulation for optimal power flow (OPF) in both radial and meshed grids. A semidefinite programming (SDP) approximation transforms the quadratic non-convex model into a relaxed convex quadratic model, which can be more ...
Oscar D. Montoya-Giraldo, Walter J. Gil-González, Alejandro Garcés-Ruíz   +2 more
doaj  

Convex Quadratic Programming for Computing Geodesic Distances on Triangle Meshes

Mathematics
Querying the geodesic distance field on a given smooth surface is a fundamental research pursuit in computer graphics. Both accuracy and smoothness serve as common indicators for evaluating geodesic algorithms.
Shuangmin Chen, Nailei Hei, Shun Hu, Zijia Yue, Ying He   +4 more
doaj   +1 more source

Convex underestimating relaxation techniques for nonconvex polynomial programming problems: computational overview

Journal of the Mechanical Behavior of Materials, 2015
This paper introduces constructing convex-relaxed programs for nonconvex optimization problems. Branch-and-bound algorithms are convex-relaxation-based techniques.
Keller André A.
doaj   +1 more source

Convex Optimization in R

Journal of Statistical Software, 2014
Convex optimization now plays an essential role in many facets of statistics. We briefly survey some recent developments and describe some implementations of these methods in R .
Roger Koenker, Ivan Mizera
doaj   +1 more source

R-algorithm for Solving Quadratic Programming Problems

Кібернетика та комп'ютерні технології
Quadratic programming problems have a wide range of practical applications in various fields of science and engineering, particularly in financial modeling and pattern recognition, which underscores the relevance of studying methods for their efficient ...
Petro Stetsyuk, Nelia Tukalevska, Olha Khomiak, Maria Stetsyuk   +3 more
doaj   +1 more source

The Reformulation-based aGO Algorithm for Solving Nonconvex MINLP Problems – Some Improvements

Chemical Engineering Transactions, 2013
The a-reformulation (aR) technique can be used to transform any nonconvex twice-differentiable mixed-integer nonlinear programming problem to a convex relaxed form.
A. Lundell, T. Westerlund
doaj   +1 more source

Optimasi Portofolio Resiko Menggunakan Model Markowitz MVO Dikaitkan Dengan Keterbatasan Manusia Dalam Memprediksi Masa Depan Dalam Perspektif Al-Qur`an

Jurnal Fourier, 2012
Risk portfolio on modern finance has become increasingly technical, requiring the use of sophisticated mathematical tools in both research and practice. Since companies cannot insure themselves completely against risk, as human incompetence in predicting
Noor Saif Muhammad Mussafi
doaj   +1 more source

An Active-Set Algorithm for Convex Quadratic Programming Subject to Box Constraints with Applications in Non-Linear Optimization and Machine Learning

Mathematics
A quadratic programming problem with positive definite Hessian subject to box constraints is solved, using an active-set approach. Convex quadratic programming (QP) problems with box constraints appear quite frequently in various real-world applications.
Konstantinos Vogklis, Isaac E. Lagaris
doaj   +1 more source

Recent advances on support vector machines research

Technological and Economic Development of Economy, 2012
Support vector machines (SVMs), with their roots in Statistical Learning Theory (SLT) and optimization methods, have become powerful tools for problem solution in machine learning.
Yingjie Tian, Yong Shi, Xiaohui Liu
doaj   +1 more source

Fractional programming with convex quadratic forms and functions

European Journal of Operational Research, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Department of Decision and Information Sciences, University of Florida, Gainesville, FL 32611, USA ( host institution ), Benson, Harold P.   +1 more
openaire   +2 more sources