Moving higher-order Taylor approximations method for smooth constrained minimization problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
- A moving balls approximation method for a class of smooth constrained minimization problems
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- A systematic approach to general higher-order majorization-minimization algorithms for (non)convex optimization
- Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications
- Clarke Subgradients of Stratifiable Functions
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
- Cubic regularization of Newton method and its global performance
- Efficiency of higher-order algorithms for minimizing composite functions
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- Global optimization of signomial geometric programming using linear relaxation.
- High-order optimization methods for fully composite problems
- Implementable tensor methods in unconstrained convex optimization
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- Multiplier and gradient methods
- Neyman-Pearson classification, convexity and stochastic constraints
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- On High-order Model Regularization for Constrained Optimization
- On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimization of design tolerances using nonlinear programming
- Survey of sequential convex programming and generalized Gauss-Newton methods
- Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
- The multiproximal linearization method for convex composite problems
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
This page was built for publication: Moving higher-order Taylor approximations method for smooth constrained minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846081)
