Global optimization of multivariable functions satisfying the Vanderbei condition
Fuente:
arXiv
Saved in:
| Main Authors: | Arutyunova, Natalya, Dulliev, Aidar, Zabotin, Vladislav |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A divergence-based condition to ensure quantile improvement in black-box global optimization
by: Guilmeau, Thomas, et al.
Published: (2024)
by: Guilmeau, Thomas, et al.
Published: (2024)
Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
by: Dolgopolik, M. V.
Published: (2021)
by: Dolgopolik, M. V.
Published: (2021)
A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
by: Bao, Chenglong, et al.
Published: (2025)
by: Bao, Chenglong, et al.
Published: (2025)
An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
by: Singh, Vikram, et al.
Published: (2025)
by: Singh, Vikram, et al.
Published: (2025)
New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)
by: Tawarmalani, Mohit
Published: (2024)
Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
by: Okamura, Kaito, et al.
Published: (2024)
by: Okamura, Kaito, et al.
Published: (2024)
Parameter-free accelerated gradient descent for nonconvex minimization
by: Marumo, Naoki, et al.
Published: (2022)
by: Marumo, Naoki, et al.
Published: (2022)
Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence
by: Marumo, Naoki, et al.
Published: (2022)
by: Marumo, Naoki, et al.
Published: (2022)
Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
by: Zhang, Minxin, et al.
Published: (2024)
by: Zhang, Minxin, et al.
Published: (2024)
Learning to Choose Branching Rules for Nonconvex MINLPs
by: Berthold, Timo, et al.
Published: (2026)
by: Berthold, Timo, et al.
Published: (2026)
An interior point method for nonlinear constrained derivative-free optimization
by: Brilli, Andrea, et al.
Published: (2021)
by: Brilli, Andrea, et al.
Published: (2021)
A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
by: Xie, Pengcheng, et al.
Published: (2023)
by: Xie, Pengcheng, et al.
Published: (2023)
CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization
by: Chen, Yiwen, et al.
Published: (2025)
by: Chen, Yiwen, et al.
Published: (2025)
Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
by: Lara, Felipe, et al.
Published: (2024)
by: Lara, Felipe, et al.
Published: (2024)
A novel numerical method tailored for unconstrained optimization problems
by: Li, Lin, et al.
Published: (2025)
by: Li, Lin, et al.
Published: (2025)
Optimistic Bilevel Optimization with Composite Lower-Level Problem
by: Solla, Mattia, et al.
Published: (2026)
by: Solla, Mattia, et al.
Published: (2026)
Trust-region filter algorithms utilizing Hessian information for gray-box optimization
by: Hameed, Gul, et al.
Published: (2025)
by: Hameed, Gul, et al.
Published: (2025)
$Q$-fully Quadratic Modeling and its Application in a Random Subspace Derivative-free Method
by: Chen, Yiwen, et al.
Published: (2023)
by: Chen, Yiwen, et al.
Published: (2023)
BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization
by: Hu, Wei, et al.
Published: (2026)
by: Hu, Wei, et al.
Published: (2026)
MATRO: Metric-Aware Trust-Region Optimization with Fully Quadratic Models
by: Hu, Wei, et al.
Published: (2026)
by: Hu, Wei, et al.
Published: (2026)
Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
by: Brilli, Andrea, et al.
Published: (2024)
by: Brilli, Andrea, et al.
Published: (2024)
PDFO: A Cross-Platform Package for Powell's Derivative-Free Optimization Solvers
by: Ragonneau, Tom M., et al.
Published: (2023)
by: Ragonneau, Tom M., et al.
Published: (2023)
ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
by: Rando, Marco, et al.
Published: (2026)
by: Rando, Marco, et al.
Published: (2026)
Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)
by: Deng, Kangkang, et al.
Published: (2024)
Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
by: Li, Qia, et al.
Published: (2024)
by: Li, Qia, et al.
Published: (2024)
On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
by: Gfrerer, H.
Published: (2024)
by: Gfrerer, H.
Published: (2024)
A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)
by: Kanzow, Christian, et al.
Published: (2025)
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
by: Marumo, Naoki, et al.
Published: (2023)
by: Marumo, Naoki, et al.
Published: (2023)
A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)
by: Zhou, Junpeng, et al.
Published: (2025)
A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
by: Fest, Jean-Baptiste, et al.
Published: (2023)
by: Fest, Jean-Baptiste, et al.
Published: (2023)
A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
by: Lin, Yizun, et al.
Published: (2024)
by: Lin, Yizun, et al.
Published: (2024)
Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)
by: Zhou, Juan, et al.
Published: (2024)
Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
by: Kannan, Rohit, et al.
Published: (2022)
by: Kannan, Rohit, et al.
Published: (2022)
A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)
by: Mannel, Florian
Published: (2024)
Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient
by: Morinaga, Daiki, et al.
Published: (2022)
by: Morinaga, Daiki, et al.
Published: (2022)
Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)
by: Deng, Kangkang, et al.
Published: (2025)
Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
by: Turan, Evren M., et al.
Published: (2023)
by: Turan, Evren M., et al.
Published: (2023)
Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
by: Renani, Neda Bagheri, et al.
Published: (2025)
by: Renani, Neda Bagheri, et al.
Published: (2025)
Optimization of Closed-Loop Shallow Geothermal Systems Using Analytical Models
by: Heinzel, Oliver, et al.
Published: (2026)
by: Heinzel, Oliver, et al.
Published: (2026)
A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
by: Kempke, Nils-Christian, et al.
Published: (2024)
by: Kempke, Nils-Christian, et al.
Published: (2024)
Similar Items
-
A divergence-based condition to ensure quantile improvement in black-box global optimization
by: Guilmeau, Thomas, et al.
Published: (2024) -
Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
by: Dolgopolik, M. V.
Published: (2021) -
A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
by: Bao, Chenglong, et al.
Published: (2025) -
An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
by: Singh, Vikram, et al.
Published: (2025) -
New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)