Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 02:06, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary	scientific article

Statements

scholarly article

0 references

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

0 references

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

22 October 2019

0 references

full work available at URL

https://arxiv.org/abs/1702.04300

0 references

zbMATH Keywords

constrained optimization

0 references

nonconvex programming

0 references

interior point method

0 references

first order algorithm

0 references

nonsmooth problems

0 references

MaRDI profile type

0 references

Mesh Adaptive Direct Search Algorithms for Constrained Optimization

0 references

On sequential optimality conditions for smooth constrained optimization

0 references

A second-order sequential optimality condition associated to the convergence of optimization algorithms

0 references

A relaxed constant positive linear dependence constraint qualification and applications

0 references

Two New Weak Constraint Qualifications and Applications

0 references

A Cone-Continuity Constraint Qualification and Algorithmic Consequences

0 references

A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences

0 references

Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization

0 references

Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization

0 references

Linearly Constrained Non-Lipschitz Optimization for Image Restoration

0 references

Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization

0 references

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

0 references

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

0 references

The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization

0 references

Accelerated Methods for NonConvex Optimization

0 references

Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity

0 references

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

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

On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods

0 references

Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization

0 references

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

0 references

Complexity bounds for second-order optimality in unconstrained optimization

0 references

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients

0 references

Penalty Methods for a Class of Non-Lipschitz Optimization Problems

0 references

Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization

0 references

A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

Nonconcave Penalized Likelihood With NP-Dimensionality

0 references

Strong oracle optimality of folded concave penalized estimation

0 references

0 references

Computing Optimal Locally Constrained Steps

0 references

Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians

0 references

On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization

0 references

Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality

0 references

Recursive Trust-Region Methods for Multiscale Nonlinear Optimization

0 references

A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms

0 references

New constraint qualifications with second-order properties in nonlinear optimization

0 references

Introduction to the Theory of Nonlinear Optimization

0 references

A new polynomial-time algorithm for linear programming

0 references

Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions

0 references

A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron

0 references

Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima

0 references

On High-order Model Regularization for Constrained Optimization

0 references

Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization

0 references

A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Cubic regularization of Newton method and its global performance

0 references

Variational Analysis

0 references

Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization

0 references

Newton’s Method with a Model Trust Region Modification

0 references

Calibrating nonconvex penalized regression in ultra-high dimension

0 references

Optimal computational and statistical rates of convergence for sparse nonconvex learning problems

0 references

On affine scaling algorithms for nonconvex quadratic programming

0 references

On the complexity of approximating a KKT point of quadratic programming

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

10.1007/S10107-018-1290-4

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2330649

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