Results 1 to 10 of about 9,971 (161)
Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming [PDF]
Journal of Inequalities and Applications, 2018 The Jacobian decomposition and the Gauss–Seidel decomposition of augmented Lagrangian method (ALM) are two popular methods for separable convex programming. However, their convergence is not guaranteed for three-block separable convex programming.
Min Sun, Yiju Wang
doaj +2 more sources
Stability in E-convex programming [PDF]
International Journal of Mathematics and Mathematical Sciences, 2001 We define and analyze two kinds of stability in E-convex programming problem in which the feasible domain is affected by an operator E. The first kind of this stability is that the set of all operators E that make an optimal set stable while the other ...
Ebrahim A. Youness
doaj +2 more sources
Survey of sequential convex programming and generalized Gauss-Newton methods* [PDF]
ESAIM: Proceedings and Surveys, 2021 We provide an overview of a class of iterative convex approximation methods for nonlinear optimization problems with convex-over-nonlinear substructure.
Messerer Florian +2 more
doaj +1 more source
Data-based polyhedron model for optimization of engineering structures involving uncertainties
Data-Centric Engineering, 2021 This paper studies the data-based polyhedron model and its application in uncertain linear optimization of engineering structures, especially in the absence of information either on probabilistic properties or about membership functions in the fussy sets-
Zhiping Qiu +3 more
doaj +1 more source
Least Squares Method for Solving Fuzzy LR Interval Algebraic Linear Systems
Fuzzy Information and Engineering, 2022 We first investigate the solvability conditions of fuzzy LR interval algebraic linear systems with fuzzy LR interval coefficient matrix and fuzzy LR interval hand-right vector.
Mehrnoosh Salari +2 more
doaj +1 more source
Optimal Power Flow Solution for Bipolar DC Networks Using a Recursive Quadratic Approximation
Energies, 2023 The problem regarding of optimal power flow in bipolar DC networks is addressed in this paper from the recursive programming stand of view. A hyperbolic relationship between constant power terminals and voltage profiles is used to resolve the optimal ...
Oscar Danilo Montoya +2 more
doaj +1 more source
Journal of Inequalities and Applications, 2020 The convex nonlinear second-order cone programming with linear constraints is equivalent to a separate structure convex programming. A prediction-correction inexact alternating direction method is proposed for the separate structure convex programming ...
Yaling Zhang, Hongwei Liu
doaj +1 more source
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
Convex Optimization for Rendezvous and Proximity Operation via Birkhoff Pseudospectral Method
Aerospace, 2022 Rapid and accurate rendezvous and proximity operations for spacecraft are crucial to the success of most space missions. In this paper, a sequential convex programming method, combined with the first-order and second-order Birkhoff pseudospectral methods,
Zhiwei Zhang +4 more
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 ...
Xinyue Shen 0002 +3 more
openaire +2 more sources