kkt system
Recently Published Documents


TOTAL DOCUMENTS

13
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

2020 ◽  
Vol 37 (04) ◽  
pp. 2040012
Author(s):  
Tianyu Zhang ◽  
Liwei Zhang

It was proved in Izmailov and Solodov (2014). Newton-Type Methods for Optimization and Variational Problems, Springer] that the existence of a noncritical multiplier for a (smooth) nonlinear programming problem is equivalent to an error bound condition for the Karush–Kuhn–Thcker (KKT) system without any assumptions. This paper investigates whether this result still holds true for a (smooth) nonlinear semidefinite programming (SDP) problem. The answer is negative: the existence of noncritical multiplier does not imply the error bound condition for the KKT system without additional conditions, which is illustrated by an example. In this paper, we obtain characterizations, in terms of the problem data, the critical and noncritical multipliers for a SDP problem. We prove that, for the SDP problem, the noncriticality property can be derived from the error bound condition for the KKT system without any assumptions, and we give an example to show that the noncriticality does not imply the error bound for the KKT system. We propose a set of assumptions under which the error bound condition for the KKT system can be derived from the noncriticality property. a Finally, we establish a new error bound for [Formula: see text]-part, which is expressed by both perturbation and the multiplier estimation.


2020 ◽  
Vol 26 ◽  
pp. 88
Author(s):  
Shu-Lin Wu ◽  
Tao Zhou

Solving parabolic PDE-constrained optimization problems requires to take into account the discrete time points all-at-once, which means that the computation procedure is often time-consuming. It is thus desirable to design robust and analyzable parallel-in-time (PinT) algorithms to handle this kind of coupled PDE systems with opposite evolution directions. To this end, for two representative model problems which are, respectively, the time-periodic PDEs and the initial-value PDEs, we propose a diagonalization-based approach that can reduce dramatically the computational time. The main idea lies in carefully handling the associated time discretization matrices that are denoted by Bper and Bini for the two problems. For the first problem, we diagonalize Bper directly and this results in a direct PinT algorithm (i.e., non-iterative). For the second problem, the main idea is to design a suitable approximation B̂per of Bini, which naturally results in a preconditioner of the discrete KKT system. This preconditioner can be used in a PinT pattern, and for both the Backward-Euler method and the trapezoidal rule the clustering of the eigenvalues and singular values of the preconditioned matrix is justified. Compared to existing preconditioners that are designed by approximating the Schur complement of the discrete KKT system, we show that the new preconditioner leads to much faster convergence for certain Krylov subspace solvers, e.g., the GMRES and BiCGStab methods. Numerical results are presented to illustrate the advantages of the proposed PinT algorithm.


2012 ◽  
Vol 2012 ◽  
pp. 1-12
Author(s):  
X. Zhao ◽  
S. G. Zhang ◽  
Y. T. Yang ◽  
Q. H. Liu

A combined interior point homotopy continuation method is proposed for solving general multiobjective programming problem. We prove the existence and convergence of a smooth homotopy path from almost any interior initial interior point to a solution of the KKT system under some basic assumptions.


2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
X. Zhao ◽  
S. G. Zhang ◽  
Q. H. Liu

We present a combined homotopy interior-point method for a general multiobjective programming problem. For solving the KKT points of the multiobjective programming problem, the homotopy equation is constructed. We prove the existence and convergence of a smooth homotopy path from almost any initial interior point to a solution of the KKT system under some basic assumptions.


Sign in / Sign up

Export Citation Format

Share Document