AAR-based decomposition algorithm for non-linear convex optimisation

DOI10.1007/s10589-015-9750-8zbMath1337.90051OpenAlexW2104958409MaRDI QIDQ902092

Nima Rabiei, J. J. Muñoz

Publication date: 7 January 2016

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/76414

zbMATH Keywords

decompositionconvex optimisationnonlinear optimisationsecond-order cone program (SOCP)averaged alternating reflections (AAR)

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Uses Software

• SDPT3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• Smooth minimization of non-smooth functions
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Hilbertian convex feasibility problem: Convergence of projection methods
• Formulation and solution of some plasticity problems as conic programs
• Mixed method and convex optimization for limit analysis of homogeneous Gurson materials: a kinematical approach
• On the convergence of von Neumann's alternating projection algorithm for two sets
• A proximal-based deomposition method for compositions method for convex minimization problems
• On implementing a primal-dual interior-point method for conic quadratic optimization
• Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
• Asymptotic behavior of contractions in Hilbert space
• Lower bound limit analysis of cohesive-frictional materials using second-order cone programming
• Upper and lower bounds in limit analysis: Adaptive meshing strategies and discontinuous loading
• Signal synthesis in the presence of an inconsistent set of constraints
• On Projection Algorithms for Solving Convex Feasibility Problems
• A decomposition procedure for large‐scale optimum plastic design problems
• Lower bound limit analysis using non-linear programming
• A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints
• Application of a Smoothing Technique to Decomposition in Convex Optimization
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• Convex analysis and monotone operator theory in Hilbert spaces
• Best approximation in inner product spaces