A simple characterization of solutions sets of convex programs

DOI10.1016/0167-6377(88)90047-8MaRDI QIDQ1108196zbMATH OpenOpenAlexWikidataFDO

Authors O. L. Mangasarian

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

zbMATH Keywords

nonsmooth optimizationsubdifferentialsubgradientsolution setconvex quadratic programmonotone linear complementaritypolyhedral characterization

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Characterization of solution sets of convex programs
• Characterizations of the solution sets of convex programs and variational inequality problems
• scientific article; zbMATH DE number 2027845
• Characterizations of solution sets of cone-constrained convex programming problems
• Characterizations of solution sets of differentiable quasiconvex programming problems

Cites work

• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 3511879 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• Characterizations of bounded solutions of linear complementarity problems
• Complementary pivot theory of mathematical programming
• Convex Analysis
• Error bounds for monotone linear complementarity problems

Cited in

(only showing first 100 items - show all)

• Optimality conditions and constraint qualifications for quasiconvex programming
• The convexity of the solution set of a pseudoconvex inequality
• The Geometry of Sparse Analysis Regularization
• Computing minimum norm solution of a specific constrained convex nonlinear problem
• Error bounds for nondegenerate monotone linear complementarity problems
• A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
• A note on characterizing solution set of nonsmooth pseudoinvex optimization problem
• Characterizations of the solution set for a class of nonsmooth optimization problems
• Differentiable McCormick relaxations
• On characterizing the solution sets of pseudolinear programs
• A new approach to characterize the solution set of a pseudoconvex programming problem
• Γ-robust linear complementarity problems
• Optimality conditions for bilevel programming problems
• Characterizing robust solution sets of convex programs under data uncertainty
• Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
• Characterizations of optimal solution sets of convex infinite programs
• Infinite-dimensional convex programming with applications to constrained approximation
• Linear fractional optimization problems on Jordan Euclidean algebras
• A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints
• Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
• Characterization of solution sets of quasiconvex programs
• Asymptotic behavior of the central path for a special class of degenerate SDP problems
• A Variable-Complexity Norm Maximization Problem
• On closed convex sets without boundary rays and asymptotes
• On characterization of solution sets of set-valued pseudoinvex optimization problems
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• Global error bounds for convex quadratic inequality systems^*
• Characterizations of solution sets for two nonsymmetric cone programs
• On characterizing the solution sets of pseudoinvex extremum problems
• Optimization and variational inequalities with pseudoconvex functions
• A partial first-order affine-scaling method
• Characterizing the solution set of convex optimization problems without convexity of constraints
• Minimum-support solutions of polyhedral concave programs^*
• scientific article; zbMATH DE number 791044 (Why is no real title available?)
• A class of primal affine scaling algorithms
• Minimum norm solution to the absolute value equation in the convex case
• A first-order interior-point method for linearly constrained smooth optimization
• On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power
• On alternative optimal solutions to quasimonotonic programming with linear constraints
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• scientific article; zbMATH DE number 7450966 (Why is no real title available?)
• Invariant pseudolinearity with applications
• Uniqueness and multiplicity of market equilibria on DC power flow networks
• A note on characterization of solution sets to pseudolinear programming problems
• An inexact augmented Lagrangian method for second-order cone programming with applications
• Minimum principle sufficiency
• Characterizations of the solution sets of convex programs and variational inequality problems
• On the characterization of some families of closed convex sets
• Characterizing robust -optimal solution sets for uncertain convex optimization problems
• Characterizations of the solution set of nonsmooth semi-infinite programming problems on Hadamard manifolds
• Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
• Characterization of solution sets of convex programs
• Generalized pseudolinearity
• Nonconvex composite multiobjective nonsmooth fractional programming
• Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
• Characterizations of the solution set for tangentially convex optimization problems
• Some properties of solution sets to nonconvex quadratic programming problems
• Pseudolinear fuzzy mappings
• Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
• A multilevel model of the European entry-exit gas market
• Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
• Second-order global optimality conditions for optimization problems
• Optimal solution characterization for infinite positive semi-definite programming
• On characterizations of solution sets of interval-valued quasiconvex programming problems
• Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
• Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
• Uniqueness of market equilibrium on a network: a peak-load pricing approach
• On degenerate doubly nonnegative projection problems
• Characterizations of solution sets of differentiable quasiconvex programming problems
• Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
• A note on finite termination of iterative algorithms in mathematical programming
• Γ‐robust linear complementarity problems with ellipsoidal uncertainty sets
• Optimality conditions for quasiconvex programming in terms of quasiconjugate functions
• Finite convergence of algorithms for nonlinear programs and variational inequalities
• Finite perturbation of convex programs
• Long-run market equilibria in coupled energy sectors: a study of uniqueness
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
• Solving the classification problem using -nets
• Characterizations of robust solution set of convex programs with uncertain data
• Characterizations of solution sets of convex vector minimization problems
• A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
• Generalized weak sharp minima in cone-constrained convex optimization with applications
• On electricity market equilibria with storage: modeling, uniqueness, and a distributed ADMM
• On characterizing solution set of non-differentiable -pseudolinear extremum problem
• An alternative approach for a distance inequality associated with the second-order cone and the circular cone
• On solution set for semidefinite optimization problems
• Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces
• Characterizations of solution sets of cone-constrained convex programming problems
• Higher order invex functions and higher order pseudoinvex ones
• Optimal storage and transmission investments in a bilevel electricity market model
• Optimality conditions in optimization problems with convex feasible set using convexificators
• Augmented Lagrangian methods for convex matrix optimization problems
• Characterizations of the solution set for non-essentially quasiconvex programming
• Characterizations of the solution sets of generalized convex fuzzy optimization problem
• New uniform parametric error bounds
• Characterizations of solution sets of nonsmooth mathematical programming problems
• Convex composite multi-objective nonsmooth programming
• Second-order optimality conditions and Lagrange multiplier characterizations of the solution set in quasiconvex programming
• Publisher correction: ``On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power
• Exact optimization: Part I

This page was built for publication: A simple characterization of solutions sets of convex programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108196)