Minimum principle sufficiency
The authors study the determination of a solution of a convex program by minimizing over the feasible region a linearized form of the objective function at any of its solution points (Minimum Principle Sufficiency, shortly MPS). Thus, for the case of a monotone linear complementarity problem the MPS property is equivalent to the existence of a nondegenerate solution to the problem. For the case of a convex quadratic program, the MPS property is equivalent to the span of the Hessian of the objective function being contained in the normal cone to the feasible region at any solution point, plus the cone generated by the gradient of the objective function at any solution point. This in turn is equivalent to the quadratic program having a weak sharp minimum. An important application of the MPS property is that minimizing on the feasible region a linearization of the objective function at a point in a neighborhood of a solution point gives an exact solution of the convex program.
- A note on minimal sufficiency
- On minimum interdependence principle
- Infimum Principle
- scientific article; zbMATH DE number 5146008
- Sufficiency conditions with minimal regularity assumptions
- Minimax context principle
- scientific article; zbMATH DE number 21093
- On necessary conditions for a minimum
- scientific article; zbMATH DE number 61488
- scientific article; zbMATH DE number 1431648
- A simple characterization of solutions sets of convex programs
- A stable theorem of the alternative: An extension of the Gordan theorem
- Characterization of solution sets of convex programs
- Error bounds for nondegenerate monotone linear complementarity problems
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Finite termination of the proximal point algorithm
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
- Necessary and sufficient conditions for a penalty method to be exact
- Nonlinear Perturbation of Linear Programs
- On the convergence of projected gradient processes to singular critical points
- Optimal simplex tableau characterization of unique and bounded solutions of linear programs
- Projected gradient methods for linearly constrained problems
- A maximum principle approach to risk indifference pricing with partial information
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities
- First-order conditions for isolated locally optimal solutions
- Error bounds in mathematical programming
- Continuities of metric projection and geometric consequences
- Characterization of weakly sharp solutions of a variational-type inequality with convex functional
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
- Sufficiency conditions with minimal regularity assumptions
- Error estimates and Lipschitz constants for best approximation in continuous function spaces
- Minimum and maximum principle sufficiency for a nonsmooth variational inequality
- On weak sharp solutions in \((\rho , \mathbf{b}, \mathbf{d})\)-variational inequalities
- Some aspects of nonsmooth variational inequalities on Hadamard manifolds
- Pseudomonotone\(_*\) maps and the cutting plane property
- Minimum and maximum principle sufficiency properties for nonsmooth variational inequalities
- A Lipschitzian error bound for convex quadratic symmetric cone programming
- scientific article; zbMATH DE number 61488 (Why is no real title available?)
- scientific article; zbMATH DE number 850978 (Why is no real title available?)
- scientific article; zbMATH DE number 857674 (Why is no real title available?)
- On a class of controlled differential variational inequalities
- Some results on \((\rho,\mathbf{b},\mathbf{d})\)-variational inequalities
- On controlled variational inequalities involving convex functionals
- On a class of variational-type inequalities involving curvilinear integral functionals
- Weak sharp solutions for variational inequalities in Banach spaces
- Analysis of variational inequalities with fractional curvilinear integral functionals
- On minimum interdependence principle
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Weak sharp solutions associated with a multidimensional variational-type inequality
This page was built for publication: Minimum principle sufficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198327)
