AAR-based decomposition algorithm for non-linear convex optimisation (Q902092): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104958409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing a primal-dual interior-point method for conic quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of von Neumann's alternating projection algorithm for two sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and monotone operator theory in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4163944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal-based deomposition method for compositions method for convex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbertian convex feasibility problem: Convergence of projection methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best approximation in inner product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal synthesis in the presence of an inconsistent set of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition procedure for large‐scale optimum plastic design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulation and solution of some plasticity problems as conic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound limit analysis using non-linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound limit analysis of cohesive-frictional materials using second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds in limit analysis: Adaptive meshing strategies and discontinuous loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of a Smoothing Technique to Decomposition in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak convergence of the sequence of successive approximations for nonexpansive mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed method and convex optimization for limit analysis of homogeneous Gurson materials: a kinematical approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of contractions in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank

Latest revision as of 07:49, 11 July 2024

scientific article
Language Label Description Also known as
English
AAR-based decomposition algorithm for non-linear convex optimisation
scientific article

    Statements

    AAR-based decomposition algorithm for non-linear convex optimisation (English)
    0 references
    0 references
    0 references
    7 January 2016
    0 references
    0 references
    decomposition
    0 references
    convex optimisation
    0 references
    nonlinear optimisation
    0 references
    second-order cone program (SOCP)
    0 references
    averaged alternating reflections (AAR)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references