A joint UAV trajectory, user association, and beamforming design strategy for multi-UAV assisted ISAC systems
R Zhang, Y Zhang, R Tang, H Zhao… - IEEE Internet of …, 2024 - ieeexplore.ieee.org
In this article, we investigate a resource allocation problem for a multiunmanned aerial
vehicle (UAV) assisted integrated sensing and communication (ISAC) system, where a …
vehicle (UAV) assisted integrated sensing and communication (ISAC) system, where a …
Exploiting negative curvature in deterministic and stochastic optimization
FE Curtis, DP Robinson - Mathematical Programming, 2019 - Springer
This paper addresses the question of whether it can be beneficial for an optimization
algorithm to follow directions of negative curvature. Although prior work has established …
algorithm to follow directions of negative curvature. Although prior work has established …
A second-order sequential optimality condition associated to the convergence of optimization algorithms
Sequential optimality conditions have recently played an important role on the analysis of
the global convergence of optimization algorithms towards first-order stationary points …
the global convergence of optimization algorithms towards first-order stationary points …
A fast and simple modification of Newton's method avoiding saddle points
We propose in this paper New Q-Newton's method. The update rule is conceptually very
simple, using the projections to the vector subspaces generated by eigenvectors of positive …
simple, using the projections to the vector subspaces generated by eigenvectors of positive …
Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
Augmented Lagrangian methods with convergence to second-order stationary points in
which any constraint can be penalized or carried out to the subproblems are considered in …
which any constraint can be penalized or carried out to the subproblems are considered in …
On optimality conditions for nonlinear conic programming
Sequential optimality conditions play a major role in proving stronger global convergence
results of numerical algorithms for nonlinear programming. Several extensions are …
results of numerical algorithms for nonlinear programming. Several extensions are …
On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
This paper discusses the use of a stopping criterion based on the scaling of the Karush–
Kuhn–Tucker (KKT) conditions by the norm of the approximate Lagrange multiplier in the …
Kuhn–Tucker (KKT) conditions by the norm of the approximate Lagrange multiplier in the …
On the Burer–Monteiro method for general semidefinite programs
D Cifuentes - Optimization Letters, 2021 - Springer
Consider a semidefinite program involving an n * nn× n positive semidefinite matrix X. The
Burer–Monteiro method uses the substitution X= YY^ TX= YYT to obtain a nonconvex …
Burer–Monteiro method uses the substitution X= YY^ TX= YYT to obtain a nonconvex …
A stabilized SQP method: superlinear convergence
Stabilized sequential quadratic programming (sSQP) methods for nonlinear optimization
generate a sequence of iterates with fast local convergence regardless of whether or not the …
generate a sequence of iterates with fast local convergence regardless of whether or not the …
A predictor-corrector path-following algorithm for dual-degenerate parametric optimization problems
V Kungurtsev, J Jaschke - SIAM Journal on Optimization, 2017 - SIAM
Most path-following algorithms for tracing a solution path of a parametric nonlinear
optimization problem are only certifiably convergent under strong regularity assumptions …
optimization problem are only certifiably convergent under strong regularity assumptions …