Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
From MaRDI portal
Publication:2817246
DOI10.1080/02331934.2016.1193863zbMATH Open1396.90059OpenAlexW2412312399MaRDI QIDQ2817246FDOQ2817246
Authors: Felipe Alvarez, Julio López 
Publication date: 29 August 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1193863
Recommendations
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming
- A variable metric method for nonsmooth convex constrained optimization
- scientific article; zbMATH DE number 2201296
Cites Work
- Semidefinite Programming
- Convergence of some algorithms for convex minimization
- Composite proximal bundle method
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized Bundle Methods
- Proximité et dualité dans un espace hilbertien
- Applications of second-order cone programming
- Variable metric bundle methods: From conceptual to implementable forms
- Second-order cone programming
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- The Cutting-Plane Method for Solving Convex Programs
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Proximal minimization algorithm with \(D\)-functions
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Perturbation des méthodes d'optimisation. Applications
- On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
- A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- A method for weighted projections to the positive definite cone
- A bundle Bregman proximal method for convex nondifferentiable minimization
- A constraint linearization method for nondifferentiable convex minimization
- An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
- Multiplicative Interior Gradient Methods for Minimization over the Nonnegative Orthant
Cited In (3)
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- A two-phase-like proximal point algorithm in domains of positivity
- Proximal point algorithm with Schur decomposition on the cone of symmetric semidefinite positive matrices
This page was built for publication: Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817246)
