Midcourse Guidance Trajectory Optimization of Interceptor Missile Based on Sequential Convex Programming [PDF]
Hangkong bingqi, 2023 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
Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming [PDF]
SIAM Journal on Optimization, 2016 Motivated by big data applications, first-order methods have been extremely popular in recent years. However, naive gradient methods generally converge slowly. Hence, much efforts have been made to accelerate various first-order methods.
Yangyang Xu
semanticscholar +1 more source
Efficient Convex Optimization of Reentry Trajectory via the Chebyshev Pseudospectral Method
International Journal of Aerospace Engineering, 2019 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
, 2013 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
A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem
Abstract and Applied Analysis, 2014 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
Nonparametric estimation by convex programming
, 2009 The problem we concentrate on is as follows: given (1) a convex compact set $X$ in ${\mathbb{R}}^n$, an affine mapping $x\mapsto A(x)$, a parametric family $\{p_{\mu}(\cdot)\}$ of probability densities and (2) $N$ i.i.d.
Juditsky, Anatoli B. +1 more
core +5 more sources
A Note on Optimality Conditions for DC Programs Involving Composite Functions
Abstract and Applied Analysis, 2014 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
Convex Optimisation Model for Ship Speed Profile: Optimisation under Fixed Schedule
Journal of Marine Science and Engineering, 2021 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
Convex Programs for Temporal Verification of Nonlinear Dynamical Systems [PDF]
, 2007 A methodology for safety verification of continuous and hybrid systems using barrier certificates has been proposed recently. Conditions that must be satisfied by a barrier certificate can be formulated as a convex program, and the feasibility of the ...
Prajna, Stephen, Rantzer, Anders
core +1 more source
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem [PDF]
, 2018 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