Výsledky vyhľadávania - "Convex Programming"

Model Predictive Convex Programming for Constrained Vehicle Guidance Autor Hong, Haichao, Maity, Arnab, Holzapfel, Florian, Tang, Shengjing

“…A new model predictive convex programming is proposed in this paper for state and input constrained vehicle guidance design…”
Získať plný text

Geometric Robot Dynamic Identification: A Convex Programming Approach Autor Lee, Taeyoon, Wensing, Patrick M., Park, Frank C.

“… systems subject to noisy and incomplete measurements. Instead, differential geometric identification methods have proven to be significantly more accurate and robust…”
Získať plný text

Square Kilometre Array Enhancement: A Convex Programming Approach to Optimize SKA-Low Stations in the Case of Perturbed Vogel Layout Autor Battaglia, Giada Maria, Caruso, Giuseppe, Bolli, Pietro, Palmeri, Roberta, Morabito, Andrea Francesco

“…This study presents a convex optimization framework for beam synthesis in Square Kilometre Array low-frequency radio telescope stations configured in a…”
Získať plný text

Low-Frequency Square Kilometer Array Pattern Optimization via Convex Programming Autor Battaglia, Giada Maria, Caruso, Giuseppe, Bolli, Pietro, Labate, Maria Grazia, Palmeri, Roberta, Morabito, Andrea Francesco

“…A well-known and powerful convex optimization strategy is exploited to enhance the electromagnetic performance of the Square Kilometer Array Low-Frequency…”
Získať plný text

Encoding inductive invariants as barrier certificates: Synthesis via difference-of-convex programming Autor Wang, Qiuye, Chen, Mingshuai, Xue, Bai, Zhan, Naijun, Katoen, Joost-Pieter

“…). We further propose a synthesis algorithm based on difference-of-convex programming, which approaches a local optimum of the BMI problem via solving a series of convex optimization problems…”
Získať plný text

On bandwidth maximization of fixed-geometry arrays through convex programming Autor Bui, L. T. P., Anselmi, N., Isernia, T., Rocca, P., Morabito, A. F.

“… The designing problem is cast as a sequence of Convex Programming optimizations. Numerous numerical experiments, including full-wave synthesis of realistic antennas…”
Získať plný text

A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization Autor Mehrotra, Sanjay, Papp, Dávid

“…We present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for…”
Získať plný text

Entry Guidance for Hypersonic Glide Vehicles via Two-Phase hp-Adaptive Sequential Convex Programming Autor Liu, Xu, Li, Xiang, Zhang, Houjun, Huang, Hao, Wu, Yonghui

“…). To achieve efficient and reliable trajectory planning, a two-phase hp-adaptive sequential convex programming (SCP…”
Získať plný text

Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming

Získať plný text

Chance-Constrained Sequential Convex Programming for Robust Trajectory Optimization Autor Lew, Thomas, Bonalli, Riccardo, Pavone, Marco

“… the signed distance function. We propose a novel sequential convex programming algorithm and prove that under a discrete time problem formulation, it is guaranteed to converge to a solution satisfying first-order optimality conditions…”
Získať plný text

H2 robust filter design with performance certificate via convex programming Autor Geromel, José C., Korogui, Rubens H.

“…In this paper a new approach to H2 robust filter design is proposed. Both continuous- and discrete-time invariant systems subject to polytopic parameter uncertainty are considered…”
Získať plný text

H 2 robust filter design with performance certificate via convex programming Autor Geromel, José C., Korogui, Rubens H.

Získať plný text

A globally convergent sequential convex programming using an enhanced two-point diagonal quadratic approximation for structural optimization Autor Park, Seonho, Jeong, Seung Hyun, Yoon, Gil Ho, Groenwold, Albert A., Choi, Dong-Hoon

“…In this study, we propose a sequential convex programming (SCP) method that uses an enhanced two-point diagonal quadratic approximation (eTDQA…”
Získať plný text

A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints Autor Trang, L.H., Kozma, A., An, P.T., Diehl, M.

“…: , where and , subject to is on the relative boundary of , for . The objective function of the problem is convex but not everywhere differentiable and the constraints are non-convex…”
Získať plný text

Characterization of the equivalence of robustification and regularization in linear and matrix regression Autor Bertsimas, Dimitris, Copenhaver, Martin S.

“… perturbations in the underlying data has been the subject of increasing interest in recent years…”
Získať plný text

Joint Load Balancing and Interference Management for Small-Cell Heterogeneous Networks With Limited Backhaul Capacity Autor Ho Huu Minh Tam, Hoang Duong Tuan, Duy Trong Ngo, Duong, Trung Q., Poor, H. Vincent

“… The objective here is either: 1) to maximize the network sum rate subject to minimum throughput requirements at individual UEs, or 2…”
Získať plný text

A physiology-based inverse dynamic analysis of human gait using sequential convex programming: a comparative study Autor De Groote, F., Demeulenaere, B., Swevers, J., De Schutter, J., Jonkers, I.

“…This paper presents an enhanced version of the previously proposed physiological inverse approach (PIA) to calculate musculotendon (MT) forces and evaluates…”
Získať plný text

Two Projection Neural Networks With Reduced Model Complexity for Nonlinear Programming Autor Xia, Youshen, Wang, Jun, Guo, Wenzhong

“…Recent reports show that projection neural networks with a low-dimensional state space can enhance computation speed obviously. This paper proposes two…”
Získať plný text

Constrained Spacecraft Attitude Control Using Sequential Convex Programming Autor Melville, Nicholas

“…This thesis describes how sequential convex programming can be used to guide and control the attitude of a spacecraft which is subject to pointing constraints…”
Získať plný text

The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming Autor Li, Min, Yuan, Xiaoming

“…We consider a separable convex minimization model whose variables are coupled by linear constraints and they are subject to the positive orthant constraints, and its objective function is in form of m…”
Získať plný text