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