Global infimum of strictly convex quadratic functions with bounded perturbations (Q604811): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Lipschitz behavior of convex semi-infinite optimization problems: a variational approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Davidson Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of the solution of definite quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of mathematical programming techniques in optimal power dispatch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the lower semicontinuity of optimal sets in convex parametric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower semicontinuity of the minimum in parametric convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal value function of a linearly perturbed quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuity of the solution map in quadratic programs under linear perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds for the smallest eigenvalue of a Hermitian positive-definite matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support set expansion sensitivity analysis in convex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strictly and roughly convexlike functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer \(\gamma\)-convexity and inner \(\gamma\)-convexity of disturbed functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of solution sets to nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer Γ-Convexity in Vector Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Convex Functions with Bounded Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer \(\gamma\)-convexity in normed linear spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2725642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of solutions to quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimates for Kuhn-Tucker points of perturbed convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality theorems for perturbed convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbed convex programming in reflexive Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of power generation via large-scale nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing an optimal input in perturbed convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3957539 / rank
 
Normal rank

Revision as of 10:52, 3 July 2024

scientific article
Language Label Description Also known as
English
Global infimum of strictly convex quadratic functions with bounded perturbations
scientific article

    Statements

    Global infimum of strictly convex quadratic functions with bounded perturbations (English)
    0 references
    0 references
    0 references
    12 November 2010
    0 references
    The aim of this paper is to minimize over some convex subset of \({\mathbb R}^n\) a function \(\tilde{f}\) obtained by perturbing a strictly convex quadratic function \(f(x)=x^TAx+b^Tx\) by a function \(p\) bounded by some positive number \(s\). The convexity of \(f\) is not completely lost by adding a bounded perturbation, since some trace remains in form of rough convexity of \(\tilde f.\) In Section 2 the notion of outer \(\gamma\)-convexity is introduced: \(\tilde f:D\to {\mathbb R}\) is said to be outer \(\gamma\)-convex (strictly) w.r.t. roughness degree \(\gamma>0\) if for all \(x_0,x_1\in D\) satisfying \(\|x_0-x_1\|>\gamma\) there is a closed subset \(\Lambda\subset [0,1]\) containing \(\{0,1\}\) such that \[ [x_0,x_1]\subset \{(1-\lambda)x_0+\lambda x_1|\lambda\in\Lambda\}+\overline{B}(0,\gamma/2) \] and \[ \forall \lambda\in\Lambda:\tilde{f}((1-\lambda)x_0+\lambda x_1)\leq (<) (1-\lambda)\tilde{f}(x_0)+\lambda \tilde{f}(x_1). \] Moreover, the notion of convexity modulus of \(f\) is recalled: \[ h_1(\gamma):=\inf_{x_0,x_1\in{\mathbb R}^n,\|x_0-x_1\|=\gamma}\left({1\over 2}(f(x_0)+f(x_1))-f\left({1\over 2}(x_0+x_1)\right)\right), \] where \(\gamma\in {\mathbb R}_+.\) For the function \(f\) previously defined, \(h_1(\gamma)={1\over 4}\lambda_{\min}\gamma^2, \) where \(\lambda_{\min}\) is the smallest eigenvalue of \(A.\) The (strict) outer \(\gamma\)-convexity of \(\tilde{f}\) for every \(\gamma (>) \geq \gamma^*=2(2s/\lambda_{\min})^{1/2}\) is proved using the convexity modulus \(h_1\) of \(f\). In Section 3 the sets of global infimizers and global minimizers of outer \(\gamma\)-convex functions are studied. In particular, the authors prove that a \(\gamma^*\)-local minimal solution of \(\tilde f\) is its global minimal solution, and the diameter of the set of global infimizers of \(\tilde{f}\) is less than or equal to \(\gamma^*\). In addition, they show that \(\gamma^*/2\) is a sharp upper bound of the distance between a global infimizer of \(\tilde{f}\) and the unique global minimizer of \(f\) (if any). Section 4 is devoted to the study of roughly generalized support properties; moreover, the authors prove two optimality conditions for the optimization problem with objective \(\tilde{f}\) over a set \(D\) obtained by intersecting a finite number of hyperplanes.
    0 references
    0 references
    quadratic function
    0 references
    convexity modulus
    0 references
    generalized convexity
    0 references
    outer \(\gamma\)-convexity
    0 references
    bounded perturbation
    0 references
    global minimizer
    0 references
    support property
    0 references
    optimality condition
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references