Generalized polyhedral DC optimization problems
From MaRDI portal
Cites work
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A Fenchel-Rockafellar type duality theorem for maximization
- A representation of generalized convex polyhedra and applications
- Convex Analysis
- Convex analysis and beyond. Volume I. Basic theory
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA: thirty years of developments
- Duality for nonconvex approximation and optimization.
- Duality in nonconvex optimization
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Generalized polyhedral convex optimization problems
- scientific article; zbMATH DE number 3479763 (Why is no real title available?)
- scientific article; zbMATH DE number 3634008 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- On global unconstrained minimization of the difference of polyhedral functions
- On the problem of minimizing a difference of polyhedral convex functions under linear constraints
- Open issues and recent advances in DC programming and DCA
- Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces
- Solving polyhedral d.c. optimization problems via concave minimization
- Strong duality and solution existence under minimal assumptions in conic linear programming
- Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization
- The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
- Une caractérisation complete des minima locaux en programmation quadratique
This page was built for publication: Generalized polyhedral DC optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946627)
