Results 21 to 30 of about 181,280 (177)
Pseudospectral Convex Programming for Free-Floating Space Manipulator Path Planning
Space: Science & Technology, 2023 To efficiently plan the point-to-point path for a 7-degrees-of-freedom (7-DOF) free-floating space manipulator system, a path planning method based on Legendre pseudospectral convex programming (LPCP) is proposed.
Danyi Li +7 more
doaj +1 more source
LINEAR PROGRAMMING APPLIED TO A CONVEX PROGRAMMING TYPE
Pesquimat, 2014 In the present’s paper studying a strategy for a typo of convex problem, we treat a linear programming problem whose coefficient of decision variables in the objective function has a nonlinear behavior.
Edinson Raúl Montoro Alegre +3 more
doaj +1 more source
A new approach to secure economic power dispatch [PDF]
, 1998 This article presents a new nonlinear convex network flow programming model and algorithm for solving the on-line economic power dispatch with N and N−1 security.
Irving, MR, Xu, GY, Zhu, JZ
core +1 more source
Componentwise Fractional Programming with Application to Resource Allocation [PDF]
Modeling, Identification and Control, 1983 A fractional programming problem is considered of the maximization of the ratio of a concave and a convex function, with each variable occurring in a single convex component constraint.
Kåre M. Mjelde
doaj +1 more source
Global Optimization for the Sum of Concave-Convex Ratios Problem
Journal of Applied Mathematics, 2014 This paper presents a branch and bound algorithm for globally solving the sum of concave-convex ratios problem (P) over a compact convex set. Firstly, the problem (P) is converted to an equivalent problem (P1).
XueGang Zhou, JiHui Yang
doaj +1 more source
Journal of Applied Mathematics, 2011 Convex multiobjective programming problems and multiplicative programming problems have important applications in areas such as finance, economics, bond portfolio optimization, engineering, and other fields. This paper presents a quite easy algorithm for
Le Quang Thuy +2 more
doaj +1 more source
Disciplined multi-convex programming [PDF]
2017 29th Chinese Control And Decision Conference (CCDC), 2017 A multi-convex optimization problem is one in which the variables can be partitioned into sets over which the problem is convex when the other variables are fixed. Multi-convex problems are generally solved approximately using variations on alternating or cyclic minimization.
Shen, Xinyue +4 more
openaire +2 more sources
A Multi-Step Inertial Proximal Peaceman-Rachford Splitting Method for Separable Convex Programming
IEEE Access, 2023 In this paper, we propose a multi-step inertial proximal Peaceman-Rachford splitting method (abbreviated as MIP-PRSM) for solving the two-block separable convex optimization problems with linear constraints, which is a unified framework for such Peaceman-
Hongyan Li, Dongmei Yu, Leifu Gao
doaj +1 more source
Disciplined convex-concave programming [PDF]
2016 IEEE 55th Conference on Decision and Control (CDC), 2016 In this paper we introduce disciplined convex-concave programming (DCCP), which combines the ideas of disciplined convex programming (DCP) with convex-concave programming (CCP). Convex-concave programming is an organized heuristic for solving nonconvex problems that involve objective and constraint functions that are a sum of a convex and a concave ...
Shen, Xinyue +3 more
openaire +2 more sources
Semidefinite descriptions of the convex hull of rotation matrices [PDF]
, 2014 We study the convex hull of $SO(n)$, thought of as the set of $n\times n$ orthogonal matrices with unit determinant, from the point of view of semidefinite programming. We show that the convex hull of $SO(n)$ is doubly spectrahedral, i.e. both it and its
Parrilo, Pablo A. +2 more
core +1 more source