Pages that link to "Item:Q3225248"

The following pages link to On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming (Q3225248):

Displaying 50 items.

• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
• On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization (Q494338) (← links)
• A note on the smoothing quadratic regularization method for non-Lipschitz optimization (Q494677) (← links)
• Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization'' (Q507344) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
• Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints (Q1995981) (← links)
• Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
• A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
• An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity (Q2020598) (← links)
• Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations (Q2052297) (← links)
• Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization (Q2089785) (← links)
• Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) (← links)
• Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
• Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
• Recent advances in trust region algorithms (Q2349124) (← links)
• Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
• On the complexity of finding first-order critical points in constrained nonlinear optimization (Q2452373) (← links)
• Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
• Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares (Q2696927) (← links)
• Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models (Q2802144) (← links)
• Trust-region methods without using derivatives: worst case complexity and the nonsmooth case (Q2826817) (← links)
• Penalty methods with stochastic approximation for stochastic nonlinear programming (Q2970100) (← links)
• Linearly Constrained Non-Lipschitz Optimization for Image Restoration (Q3454492) (← links)
• Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization (Q4641670) (← links)
• Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← links)
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
• A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization (Q5081096) (← links)
• First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems (Q5097011) (← links)
• Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
• Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
• On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514) (← links)
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)
• Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization (Q5248241) (← links)
• Complexity and performance of an Augmented Lagrangian algorithm (Q5858985) (← links)
• High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
• Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization (Q6113530) (← links)
• Proximal gradient algorithm with trust region scheme on Riemannian manifold (Q6123562) (← links)
• A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities (Q6126602) (← links)
• A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations (Q6165597) (← links)
• Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization (Q6179875) (← links)
• Joint synthesis of trajectory and controlled invariant funnel for discrete‐time systems with locally Lipschitz nonlinearities (Q6197955) (← links)
• Consistent fusion method with uncertainty elimination for distributed multi-sensor systems (Q6199565) (← links)
• The evaluation complexity of finding high-order minimizers of nonconvex optimization (Q6200212) (← links)
• Local convergence analysis of an inexact trust-region method for nonsmooth optimization (Q6204197) (← links)
• Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization (Q6579994) (← links)
• A Levenberg-Marquardt method for nonsmooth regularized least squares (Q6590132) (← links)
• Level constrained first order methods for function constrained optimization (Q6665379) (← links)