Results 31 to 40 of about 27,103 (155)
Optimal Control of Ascent Trajectory for Launch Vehicles: A Convex Approach
IEEE Access, 2019 This paper presents an online ascent trajectory optimization algorithm based on optimal control and convex optimization without accurate initial guesses.
Yuan Li +3 more
doaj +1 more source
A New Full-Newton Step $O(n)$ Infeasible Interior-Point Algorithm for $P_*(\kappa)$-horizontal Linear Complementarity Problems [PDF]
Computer Science Journal of Moldova, 2014 In this paper, we first present a brief review about the feasible interior-point algorithm for $P_*(\kappa)$-horizontal linear complementarity problems (HLCPs) based on new directions.
Soodabeh Asadi, Hossein Mansouri
doaj
Bad semidefinite programs: they all look the same [PDF]
, 2017 Conic linear programs, among them semidefinite programs, often behave pathologically: the optimal values of the primal and dual programs may differ, and may not be attained. We present a novel analysis of these pathological behaviors.
Bauschke H. +6 more
core +3 more sources
IEEE Access, 2019 In this work, by considering a variety of realistic hardware impairments, we aim to enhance the security of a cooperative relaying network, where a source intends to transmit its confidential information to a destination in the presence of a group of ...
Majid Moradikia +4 more
doaj +1 more source
Incorporating a four-dimensional filter line search method into an interior point framework [PDF]
, 2009 Here we incorporate a four-dimensional filter line search method into an infeasible primal-dual interior point framework for nonlinear programming.
Costa, M. Fernanda P. +1 more
core
Finding a point in the relative interior of a polyhedron [PDF]
, 2007 A new initialization or `Phase I' strategy for feasible interior point methods for linear programming is proposed that computes a point on the primal-dual central path associated with the linear program. Provided there exist primal-dual strictly feasible
Cartis, Coralia, Gould, Nicholas I. M.
core +1 more source
Improved Full-Newton Step O(nL) Infeasible Interior-Point Method for Linear Optimization [PDF]
Journal of Optimization Theory and Applications, 2009 The authors describe some improvements of the full-Newton step infeasible interior-point method (IIPM) for linear optimization introduced by C. Roos in 2006. The improved full-Newton step IIPM for linear optimization described in this paper can be seen as a homotopy method and has many interesting properties.
Gu, G. (author) +4 more
openaire +3 more sources
On Simplex Pivoting Rules and Complexity Theory
, 2014 We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm's path. Such rules cannot be the basis of a strongly polynomial algorithm, unless P = PSPACE.
Adler, Ilan +2 more
core +1 more source
Fast Second-order Cone Programming for Safe Mission Planning
, 2017 This paper considers the problem of safe mission planning of dynamic systems operating under uncertain environments. Much of the prior work on achieving robust and safe control requires solving second-order cone programs (SOCP).
Jain, Prateek +2 more
core +1 more source
Journal of Numerical Analysis and Approximation TheoryThe focus of this research is to apply primal-dual interior-point pathfollowing methods, specifically those derived from Newton’s method for solving convex quadratic semidefinite optimization (CQSDO) problems. In this paper, we present a numerical study
Yasmina Bendaas, Mohamed Achache
doaj +1 more source