A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems

2017 ◽  
Vol 27 (1) ◽  
pp. 538-564 ◽  
Author(s):  
Vyacheslav Kungurtsev ◽  
Johannes Jäschke
2014 ◽  
Vol 07 (02) ◽  
pp. 1450028 ◽  
Author(s):  
Behrouz Kheirfam

A corrector–predictor algorithm is proposed for solving semidefinite optimization problems. In each two steps, the algorithm uses the Nesterov–Todd directions. The algorithm produces a sequence of iterates in a neighborhood of the central path based on a new proximity measure. The predictor step uses line search schemes requiring the reduction of the duality gap, while the corrector step is used to restore the iterates to the neighborhood of the central path. Finally, the algorithm has [Formula: see text] iteration complexity.


2014 ◽  
pp. 77-81
Author(s):  
Chefi Triki ◽  
Lucio Grandinetti

In this paper we discuss the use computational grids to solve stochastic optimization problems. These problems are generally difficult to solve and are often characterized by a high number of variables and constraints. Furthermore, for some applications it is required to achieve a real-time solution. Obtaining reasonable results is a difficult objective without the use of high performance computing. Here we present a grid-enabled path-following algorithm and we discuss some experimental results.


Author(s):  
Patrick Mehlitz ◽  
Leonid I. Minchenko

AbstractThe presence of Lipschitzian properties for solution mappings associated with nonlinear parametric optimization problems is desirable in the context of, e.g., stability analysis or bilevel optimization. An example of such a Lipschitzian property for set-valued mappings, whose graph is the solution set of a system of nonlinear inequalities and equations, is R-regularity. Based on the so-called relaxed constant positive linear dependence constraint qualification, we provide a criterion ensuring the presence of the R-regularity property. In this regard, our analysis generalizes earlier results of that type which exploited the stronger Mangasarian–Fromovitz or constant rank constraint qualification. Afterwards, we apply our findings in order to derive new sufficient conditions which guarantee the presence of R-regularity for solution mappings in parametric optimization. Finally, our results are used to derive an existence criterion for solutions in pessimistic bilevel optimization and a sufficient condition for the presence of the so-called partial calmness property in optimistic bilevel optimization.


2020 ◽  
Vol 201 ◽  
pp. 107118 ◽  
Author(s):  
Yujiao Zhao ◽  
Xin Qi ◽  
Atilla Incecik ◽  
Yong Ma ◽  
Zhixiong Li

Sign in / Sign up

Export Citation Format

Share Document