[HTML][HTML] Recent advances in nonconvex semi-infinite programming: Applications and algorithms
The goal of this literature review is to give an update on the recent developments for semi-
infinite programs (SIPs), approximately over the last 20 years. An overview of the different …
infinite programs (SIPs), approximately over the last 20 years. An overview of the different …
Recent contributions to linear semi-infinite optimization: an update
This paper reviews the state-of-the-art in the theory of deterministic and uncertain linear
semi-infinite optimization, presents some numerical approaches to this type of problems …
semi-infinite optimization, presents some numerical approaches to this type of problems …
Learning stabilizable nonlinear dynamics with contraction-based regularization
We propose a novel framework for learning stabilizable nonlinear dynamical systems for
continuous control tasks in robotics. The key contribution is a control-theoretic regularizer for …
continuous control tasks in robotics. The key contribution is a control-theoretic regularizer for …
Robust feedback motion planning via contraction theory
We present a framework for online generation of robust motion plans for robotic systems with
nonlinear dynamics subject to bounded disturbances, control constraints, and online state …
nonlinear dynamics subject to bounded disturbances, control constraints, and online state …
Learning control-oriented dynamical structure from data
Even for known nonlinear dynamical systems, feedback controller synthesis is a difficult
problem that often requires leveraging the particular structure of the dynamics to induce a …
problem that often requires leveraging the particular structure of the dynamics to induce a …
[HTML][HTML] A new exact penalty method for semi-infinite programming problems
In this paper, we consider a class of nonlinear semi-infinite optimization problems. These
problems involve continuous inequality constraints that need to be satisfied at every point in …
problems involve continuous inequality constraints that need to be satisfied at every point in …
Near-optimal solutions of convex semi-infinite programs via targeted sampling
We propose an approach to find the optimal value of a convex semi-infinite program (SIP)
that involves identifying a finite set of relevant constraints by solving a finite-dimensional …
that involves identifying a finite set of relevant constraints by solving a finite-dimensional …
A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
J Lv, LP Pang, FY Meng - Journal of Global Optimization, 2018 - Springer
We propose an inexact proximal bundle method for constrained nonsmooth nonconvex
optimization problems whose objective and constraint functions are known through oracles …
optimization problems whose objective and constraint functions are known through oracles …
Optimal control of nonlinear switched systems: Computational methods and applications
A switched system is a dynamic system that operates by switching between different
subsystems or modes. Such systems exhibit both continuous and discrete characteristics—a …
subsystems or modes. Such systems exhibit both continuous and discrete characteristics—a …
Semi-infinitely constrained markov decision processes
We propose a generalization of constrained Markov decision processes (CMDPs) that we
call the\emph {semi-infinitely constrained Markov decision process}(SICMDP). Particularly …
call the\emph {semi-infinitely constrained Markov decision process}(SICMDP). Particularly …