Sequential Convex Programming Methods for A Class of Structured Nonlinear Programming
In this paper we study a broad class of structured nonlinear programming (SNLP) problems. In particular, we first establish the first-order optimality conditions for them. Then we propose sequential convex programming (SCP) methods for solving them in which each iteration is obtained by solving a convex programming problem. Under some suitable assumptions, we establish that any accumulation point of the sequence generated by the methods is a KKT point of the SNLP problems. In addition, we propose a variant of the SCP method for SNLP in which nonmonotone scheme and ``local'' Lipschitz constants of the associated functions are used. A similar convergence result as mentioned above is established.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Trajectory Bundle Method: Unifying Sequential-Convex Programming and Sampling-Based Trajectory Optimization
We present a unified framework for solving trajectory optimization problems in a derivative-free manner through the use of sequential convex programming. Traditionally, nonconvex optimization problems are solved by formi…
Motion PlanningNumerical Methods for Convex Multistage Stochastic Optimization
Optimization problems involving sequential decisions in a stochastic environment were studied in Stochastic Programming (SP), Stochastic Optimal Control (SOC) and Markov Decision Processes (MDP). In this paper we mainly …
Stochastic OptimizationVocal Bursts Type PredictionA first-order method for constrained nonconvex-nonconcave minimax optimization
We study a class of constrained nonconvex-nonconcave minimax optimization problems in which the inner maximization involves potentially complex constraints. Under the assumption that the inner problem of a novel lifted m…
Optimal Science-time Reorientation Policy for the Comet Interceptor Flyby via Sequential Convex Programming
This paper introduces an algorithm to perform optimal reorientation of a spacecraft during a high speed flyby mission that maximizes the time a certain target is kept within the field of view of scientific instruments. T…
Mars Entry Trajectory Planning with Range Discretization and Successive Convexification
This paper develops a sequential convex programming approach for Mars entry trajectory planning by range discretization. To improve the accuracy of numerical integration, the range of entry trajectory is selected as the …
Numerical IntegrationTrajectory Planning