Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 03:44, 17 December 2024

scientific article

Language	Label	Description	Also known as
English	Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization	scientific article

Statements

scholarly article

0 references

Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (English)

0 references

0 references

0 references

0 references

Computational Optimization and Applications

0 references

publication date

12 April 2022

0 references

full work available at URL

https://arxiv.org/abs/1908.11518

0 references

zbMATH Keywords

constrained optimization

0 references

nonconvex optimization

0 references

proximal-point method

0 references

penalty method

0 references

0 references

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

0 references

Mirror descent and convex optimization problems with non-smooth inequality constraints

0 references

Complexity and performance of an Augmented Lagrangian algorithm

0 references

Global minimization using an augmented Lagrangian method with variable lower-level constraints

0 references

Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points

0 references

An Exact Penalization Viewpoint of Constrained Optimization

0 references

On the Convergence of Successive Linear-Quadratic Programming Algorithms

0 references

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming

0 references

On the complexity of finding first-order critical points in constrained nonlinear optimization

0 references

Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization''

0 references

On the learnability and design of output codes for multiclass problems

0 references

Adaptive augmented Lagrangian methods: algorithms and practical numerical experience

0 references

Stochastic Model-Based Minimization of Weakly Convex Functions

0 references

Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems

0 references

A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints

0 references

An exact penalty function method with global convergence properties for nonlinear programming problems

0 references

Efficiency of minimizing compositions of convex functions and smooth maps

0 references

Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition

0 references

A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization

0 references

Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming

0 references

Accelerated gradient methods for nonconvex nonlinear and stochastic programming

0 references

Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems

0 references

On the Convergence of a Sequential Penalty Function Method for Constrained Minimization

0 references

Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary

0 references

Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization

0 references

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis

0 references

Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs

0 references

Iteration-complexity of first-order penalty methods for convex programming

0 references

Algorithms for stochastic optimization with function or expectation constraints

0 references

An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization

0 references

Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Barrier subgradient method

0 references

Gradient methods for minimizing composite functions

0 references

A recursive quadratic programming algorithm that uses differentiable exact penalty functions

0 references

0 references

Proximal alternating penalty algorithms for nonsmooth constrained convex optimization

0 references

An Inexact Proximal Path-Following Algorithm for Constrained Convex Minimization

0 references

Composite Self-Concordant Minimization

0 references

A Single-Phase, Proximal Path-Following Framework

0 references

Penalty methods with stochastic approximation for stochastic nonlinear programming

0 references

Global convergence of ADMM in nonconvex nonsmooth optimization

0 references

Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints

0 references

A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs

0 references

A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S10589-022-00358-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2125072

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