A simple characterization of solutions sets of convex programs
From MaRDI portal
Publication:1108196
DOI10.1016/0167-6377(88)90047-8zbMath0653.90055OpenAlexW1994433358WikidataQ111305259 ScholiaQ111305259MaRDI QIDQ1108196
Publication date: 1988
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(88)90047-8
nonsmooth optimizationsubdifferentialsolution setsubgradientconvex quadratic programmonotone linear complementaritypolyhedral characterization
Convex programming (90C25) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (98)
Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ Γ-robust linear complementarity problems ⋮ On closed convex sets without boundary rays and asymptotes ⋮ Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints ⋮ Optimality conditions for bilevel programming problems ⋮ Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems ⋮ Minimum-support solutions of polyhedral concave programs* ⋮ A Variable-Complexity Norm Maximization Problem ⋮ An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Characterization of solution sets of convex programs ⋮ Solving the classification problem using \(\varepsilon\)-nets ⋮ On characterizing the solution sets of pseudolinear programs ⋮ Limiting behavior of the central path in semidefinite optimization ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ An alternative approach for a distance inequality associated with the second-order cone and the circular cone ⋮ Long-run market equilibria in coupled energy sectors: a study of uniqueness ⋮ Characterizations of the solution sets of convex programs and variational inequality problems ⋮ Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ Linear fractional optimization problems on Jordan Euclidean algebras ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ Optimal storage and transmission investments in a bilevel electricity market model ⋮ Pseudolinear fuzzy mappings ⋮ A new approach to characterize the solution set of a pseudoconvex programming problem ⋮ Optimization and variational inequalities with pseudoconvex functions ⋮ Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions ⋮ A multilevel model of the European entry-exit gas market ⋮ On characterizing solution set of non-differentiable η-pseudolinear extremum problem ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ Generalized weak sharp minima in cone-constrained convex optimization with applications ⋮ A note on characterizing solution set of nonsmooth pseudoinvex optimization problem ⋮ Minimum norm solution to the absolute value equation in the convex case ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ Γ‐robust linear complementarity problems with ellipsoidal uncertainty sets ⋮ The Geometry of Sparse Analysis Regularization ⋮ Exact optimization: Part I ⋮ On characterizations of solution sets of interval-valued quasiconvex programming problems ⋮ A class of primal affine scaling algorithms ⋮ Characterizations of the solution set for a class of nonsmooth optimization problems ⋮ Characterization of solution sets of quasiconvex programs ⋮ Characterizations of pseudoconvex functions and semistrictly quasiconvex ones ⋮ Invariant pseudolinearity with applications ⋮ Unnamed Item ⋮ On characterization of solution sets of set-valued pseudoinvex optimization problems ⋮ A partial first-order affine-scaling method ⋮ The convexity of the solution set of a pseudoconvex inequality ⋮ Characterizations of solution sets of cone-constrained convex programming problems ⋮ On alternative optimal solutions to quasimonotonic programming with linear constraints ⋮ A note on characterization of solution sets to pseudolinear programming problems ⋮ Minimum principle sufficiency ⋮ Convex composite multi-objective nonsmooth programming ⋮ Differentiable McCormick relaxations ⋮ Uniqueness of market equilibrium on a network: a peak-load pricing approach ⋮ Nonconvex composite multiobjective nonsmooth fractional programming ⋮ Minimum norm solution to the positive semidefinite linear complementarity problem ⋮ Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems ⋮ Generalized pseudolinearity ⋮ A first-order interior-point method for linearly constrained smooth optimization ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Asymptotic behavior of the central path for a special class of degenerate SDP problems ⋮ Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs ⋮ A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings ⋮ Second-order global optimality conditions for optimization problems ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Uniqueness and multiplicity of market equilibria on DC power flow networks ⋮ A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints ⋮ Characterization of solution sets of convex optimization problems in Riemannian manifolds ⋮ A note on finite termination of iterative algorithms in mathematical programming ⋮ Unnamed Item ⋮ On characterizing the solution sets of pseudoinvex extremum problems ⋮ New uniform parametric error bounds ⋮ Second-order optimality conditions and Lagrange multiplier characterizations of the solution set in quasiconvex programming ⋮ Error bounds for nondegenerate monotone linear complementarity problems ⋮ Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces ⋮ Characterizations of optimal solution sets of convex infinite programs ⋮ Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials ⋮ Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers ⋮ Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems ⋮ Higher order invex functions and higher order pseudoinvex ones ⋮ Characterizations of the solution sets of generalized convex fuzzy optimization problem ⋮ An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications ⋮ On electricity market equilibria with storage: modeling, uniqueness, and a distributed ADMM ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints ⋮ A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems ⋮ Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications ⋮ Error bounds and strong upper semicontinuity for monotone affine variational inequalities ⋮ Global error bounds for convex quadratic inequality systems* ⋮ On Degenerate Doubly Nonnegative Projection Problems ⋮ Finite convergence of algorithms for nonlinear programs and variational inequalities ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Finite perturbation of convex programs ⋮ Infinite-dimensional convex programming with applications to constrained approximation
Cites Work
This page was built for publication: A simple characterization of solutions sets of convex programs
