AAR-based decomposition algorithm for non-linear convex optimisation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3671159 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3595777 (Why is no real title available?)
- A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints
- A decomposition procedure for large‐scale optimum plastic design problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Asymptotic behavior of contractions in Hilbert space
- Best approximation in inner product spaces
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Decomposition techniques in mathematical programming. Engineering and science applications.
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Formulation and solution of some plasticity problems as conic programs
- Hilbertian convex feasibility problem: Convergence of projection methods
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- Lower bound limit analysis of cohesive-frictional materials using second-order cone programming
- Lower bound limit analysis using non-linear programming
- Mixed method and convex optimization for limit analysis of homogeneous Gurson materials: a kinematical approach
- On Projection Algorithms for Solving Convex Feasibility Problems
- On implementing a primal-dual interior-point method for conic quadratic optimization
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Signal synthesis in the presence of an inconsistent set of constraints
- Smooth minimization of non-smooth functions
- Solving semidefinite-quadratic-linear programs using SDPT3
- Upper and lower bounds in limit analysis: Adaptive meshing strategies and discontinuous loading
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
This page was built for publication: AAR-based decomposition algorithm for non-linear convex optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902092)
