DC semidefinite programming and cone constrained DC optimization. I: Theory
From MaRDI portal
Publication:2149953
DOI10.1007/s10589-022-00374-yzbMath1489.90106arXiv2102.01481OpenAlexW4225397084MaRDI QIDQ2149953
Publication date: 27 June 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.01481
DCAsemidefinite programmingGrassmannianDC decompositionsphere packingDC optimizationcone constrained optimizationcompressed modes
Related Items
DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- On functions representable as a difference of convex functions
- Subdifferential calculus for convex operators
- Global optimality conditions for nonconvex optimization
- Conditions for global optimality. II
- Optimization. Algorithms and consistent approximations
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- On global optimality conditions and cutting plane algorithms
- Second-order cone programming
- Rank-one LMI approach to simultaneous stabilization of linear systems.
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- DC programming and DCA: thirty years of developments
- Accelerating the DC algorithm for smooth functions
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Combination between global and local methods for solving an optimization problem over the efficient set
- On the second differentiability of convex surfaces
- Global optimization for the biaffine matrix inequality problem
- A new necessary and sufficient global optimality condition for canonical DC problems
- DC programming: overview.
- On a global search in D.C. optimization problems
- A bundle method for nonsmooth DC programming with application to chance-constrained problems
- Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates
- DC semidefinite programming and cone constrained DC optimization. I: Theory
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
- Proximal bundle methods for nonsmooth DC programming
- An inertial algorithm for DC programming
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- A collection of nonsmooth Riemannian optimization problems
- Aggregate codifferential method for nonsmooth DC optimization
- Variations and extension of the convex-concave procedure
- Necessary optimality conditions for a nonsmooth semi-infinite programming problem
- An SQP-type algorithm for nonlinear second-order cone programs
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Lectures on Modern Convex Optimization
- A unifying theory of exactness of linear penalty functions
- An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming
- Graph Implementations for Nonsmooth Convex Programs
- An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
- DC Programming and DCA for General DC Programs
- DC Programming Approaches for BMI and QMI Feasibility Problems
- Semidefinite optimization
- A primal–dual interior point method for nonlinear optimization over second-order cones
- Regularity and Stability for Convex Multivalued Functions
- The Geometry of Algorithms with Orthogonality Constraints
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- The Concave-Convex Procedure
- PENNON: A code for convex nonlinear and semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Trust Region Methods
- Communication on the Grassmann manifold: a geometric approach to the noncoherent multiple-antenna channel
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
- A unifying theory of exactness of linear penalty functions II: parametric penalty functions
- Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Noncoherent MIMO Communication: Grassmannian Constellations and Efficient Detection
- A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality
- Exact penalty functions for optimal control problems I: Main theorem and free‐endpoint problems
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Compressed modes for variational problems in mathematics and physics
- Numerical Nonsmooth Optimization
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- A feasible direction algorithm for nonlinear second-order cone programs
- Optimization algorithms exploiting unitary constraints
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Nonsmooth Riemannian Optimization with Applications to Sphere Packing and Grasping
- A SURVEY OF NUMERICAL METHODS FOR NONLINEAR SEMIDEFINITE PROGRAMMING
- Convex Analysis
- Order Properties of Bounded Self-Adjoint Operators
- Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming
- Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise
- Convex analysis and global optimization
- Semi-infinite programming. Recent advances
