Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647)

scientific article; zbMATH DE number 7371744

Language	Label	Description	Also known as
English	Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity	scientific article; zbMATH DE number 7371744

Statements

instance of

scholarly article

0 references

title

Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (English)

0 references

author

Francisco Facchinei

0 references

Vyacheslav Kungurtsev

0 references

Lorenzo Lampariello

0 references

Gesualdo Scutari

0 references

published in

Mathematics of Operations Research

0 references

publication date

15 July 2021

0 references

full work available at URL

https://arxiv.org/abs/1709.03384

0 references

zbMATH Keywords

constrained optimization

0 references

nonconvex problem

0 references

diminishing stepsize

0 references

generalized stationary point

0 references

iteration complexity

0 references

describes a project that uses

Adam

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming

0 references

A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems

0 references

Q3968042

0 references

A sequential parametric convex approximation method with applications to nonconvex truss topology design problems

0 references

Q3452586

0 references

Q4001523

0 references

Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models

0 references

Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs

0 references

Optimization Methods for Large-Scale Machine Learning

0 references

A sequential quadratic programming method for potentially infeasible mathematical programs

0 references

A Robust Trust Region Method for Constrained Nonlinear Programming Problems

0 references

A robust sequential quadratic programming method

0 references

Epi-convergent Smoothing with Applications to Convex Composite Functions

0 references

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

0 references

On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization

0 references

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

0 references

Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization

0 references

Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models

0 references

Q3869074

0 references

Hybrid Random/Deterministic Parallel Algorithms for Convex and Nonconvex Big Data Optimization

0 references

Asynchronous Optimization Over Graphs: Linear Convergence Under Error Bound Conditions

0 references

Stochastic Model-Based Minimization of Weakly Convex Functions

0 references

Stochastic subgradient method converges on tame functions

0 references

On the exactness of a class of nondifferentiable penalty functions

0 references

Exact Penalty Functions in Constrained Optimization

0 references

A Global Convergence Theory for Dennis, El-Alem, and Maciel's Class of Trust-Region Algorithms for Constrained Optimization without Assuming Regularity

0 references

Robust recursive quadratic programming algorithm model with global and superlinear convergence properties

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Feasible methods for nonconvex nonsmooth problems with applications in green communications

0 references

Parallel Selective Algorithms for Nonconvex Big Data Optimization

0 references

Q3706433

0 references

Q2934045

0 references

Variations and extension of the convex-concave procedure

0 references

A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs

0 references

A Robust Algorithm for Optimization with General Equality and Inequality Constraints

0 references

A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization

0 references

On High-order Model Regularization for Constrained Optimization

0 references

Constrained Consensus and Optimization in Multi-Agent Networks

0 references

Robust Stochastic Approximation Approach to Stochastic Programming

0 references

Cubic regularization of Newton method and its global performance

0 references

Q3820365

0 references

A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization

0 references

Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming

0 references

Lipschitzian properties of multifunctions

0 references

Variational Analysis

0 references

Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory

0 references

Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning

0 references

Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems

0 references

Q5187067

0 references

On the Sequential Quadratically Constrained Quadratic Programming Methods

0 references

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

0 references

Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning

0 references

A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations

0 references

Non-Convex Distributed Optimization

0 references

Black-Box Complexity of Local Minimization

0 references

Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization

0 references

Hölder continuity of solutions to a parametric variational inequality

0 references

On the convergence of a new trust region algorithm

0 references

On Nonconvex Decentralized Gradient Descent

0 references

Identifiers

zbMATH Open document ID

1471.90137

0 references

DOI

10.1287/moor.2020.1079

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5000647