Results 1 to 10 of about 181,280 (177)
In this paper, we present an inexact multiblock alternating direction method for the point-contact friction model of the force-optimization problem (FOP).
Yaling Zhang, Xuewen Mu
doaj +1 more source
Economic Dispatch (ED) is one of the major concerns for the efficient and economical operation of the modern power system. Actual ED problem is non-convex in nature due to Ramp Rate Limits (RRL), Valve-Point Loading Effects (VPLE), and Prohibited ...
Hafiz Muhammad Awais +2 more
doaj +1 more source
Midcourse Guidance Trajectory Optimization of Interceptor Missile Based on Sequential Convex Programming [PDF]
Aiming at the trajectory optimization problem of interceptor midcourse guidance under strong nonlinear multi-constraint conditions, a trajectory optimization algorithm for fixed time constraints is proposed based on sequential convex programming method ...
Li Jiong, Zhang Jinlin, Shao Lei, Li Wanli, He Yangchao
doaj +1 more source
Convex Optimisation Model for Ship Speed Profile: Optimisation under Fixed Schedule
We present a novel convex optimisation model for ship speed profile optimisation under varying environmental conditions, with a fixed schedule for the journey.
Janne Huotari +3 more
doaj +1 more source
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem [PDF]
The ellipsoid method is an algorithm that solves the (weak) feasibility and linear optimization problems for convex sets by making oracle calls to their (weak) separation problem.
Atserias, Albert, Ochremiak, Joanna
core +4 more sources
Efficient Convex Optimization of Reentry Trajectory via the Chebyshev Pseudospectral Method
A novel sequential convex (SCvx) optimization scheme via the Chebyshev pseudospectral method is proposed for efficiently solving the hypersonic reentry trajectory optimization problem which is highly constrained by heat flux, dynamic pressure, normal ...
Chun-Mei Yu, Dang-Jun Zhao, Ye Yang
doaj +1 more source
SDP Duals without Duality Gaps for a Class of Convex Minimax Programs
In this paper we introduce a new dual program, which is representable as a semi-definite linear programming problem, for a primal convex minimax programming model problem and show that there is no duality gap between the primal and the dual whenever the ...
Jeyakumar, V., Vicente-Perez, J.
core +1 more source
Highly Robust Error Correction by Convex Programming [PDF]
This paper discusses a stylized communications problem where one wishes to transmit a real-valued signal x ∈ ℝ^n (a block of n pieces of information) to a remote receiver.
Candès, Emmanuel J., Randall, Paige A.
core +1 more source
A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem
This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP) with a nonconvex constraint set.
Lin-Peng Yang +2 more
doaj +1 more source
A Note on Optimality Conditions for DC Programs Involving Composite Functions
By using the formula of the ε-subdifferential for the sum of a convex function with a composition of convex functions, some necessary and sufficient optimality conditions for a DC programming problem involving a composite function are obtained.
Xiang-Kai Sun, Hong-Yong Fu
doaj +1 more source

