An ADMM-based SQP method for separably smooth nonconvex optimization (Q2069362)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	An ADMM-based SQP method for separably smooth nonconvex optimization	scientific article

Statements

scholarly article

0 references

An ADMM-based SQP method for separably smooth nonconvex optimization (English)

0 references

0 references

0 references

Journal of Inequalities and Applications

0 references

publication date

20 January 2022

0 references

zbMATH Keywords

nonconvex optimization

0 references

Kurdyka-Łojasiewicz property

0 references

convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1186/s13660-020-02347-3

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

A dual algorithm for the solution of nonlinear variational problems via finite element approximation

0 references

0 references

Fast alternating linearization methods for minimizing the sum of two convex functions

0 references

Fast Alternating Direction Optimization Methods

0 references

A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming

0 references

On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method

0 references

On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers

0 references

Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers

0 references

Global Convergence of Splitting Methods for Nonconvex Composite Optimization

0 references

Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems

0 references

A quadratically-convergent algorithm for general nonlinear programming problems

0 references

A successive quadratic programming algorithm with global and superlinear convergence properties

0 references

Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences

0 references

A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems

0 references

An efficient feasible SQP algorithm for inequality constrained optimization

0 references

A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints

0 references

A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization

0 references

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

0 references

Clarke Subgradients of Stratifiable Functions

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

0 references

Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions

0 references

Identifiers

zbMATH Open document ID

0 references

10.1186/s13660-020-02347-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2069362

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2069362&oldid=36759351"