Copertina

Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Lahiri, Somdeb
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C30, 90C05, 90C46
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Deterministic and Linear Model of Dynamic Optimization
di: Lahiri, Somdeb
Pubblicazione: (2025)

Linear models of dynamic optimization with linear constraints
di: Lahiri, Somdeb
Pubblicazione: (2025)

Continuity in Parametric Linear Programming
di: Lahiri, Somdeb
Pubblicazione: (2024)

The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization
di: Lahiri, Somdeb
Pubblicazione: (2024)

Second-Order Necessary Conditions, Constraint Qualifications and Exact Penalty for Mathematical Programs with Switching Constraints
di: Chen, Jiawei, et al.
Pubblicazione: (2024)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
di: Kanzow, Christian, et al.
Pubblicazione: (2025)

Optimization over convex polyhedra via Hadamard parametrizations
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
di: Mazanti, Guilherme, et al.
Pubblicazione: (2024)

Duality-based single-level reformulations of bilevel optimization problems
di: Dempe, Stephan, et al.
Pubblicazione: (2024)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
di: Li, Huimin, et al.
Pubblicazione: (2025)

On Constraint Qualifications for MPECs with Applications to Bilevel Hyperparameter Optimization for Machine Learning
di: Li, Jiani, et al.
Pubblicazione: (2025)

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
di: Sakabe, Keiya
Pubblicazione: (2026)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
di: Giang-Tran, Khanh-Hung, et al.
Pubblicazione: (2025)

A second-order sequential optimality condition for nonlinear second-order cone programming problems
di: Fukuda, Ellen H., et al.
Pubblicazione: (2023)

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
di: Lourenço, Bruno F., et al.
Pubblicazione: (2017)

Algebraic Farkas Lemma and Strong Duality for Perturbed Conic Linear Programming
di: Khanh, P. D., et al.
Pubblicazione: (2026)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
di: Fersztand, David, et al.
Pubblicazione: (2024)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
di: McRae, Andrew D., et al.
Pubblicazione: (2023)

Hidden convexity of quadratic systems and its application to quadratic programming
di: Huy, Nguyen Quang, et al.
Pubblicazione: (2026)

A minimal face constant rank constraint qualification for reducible conic programming
di: Andreani, Roberto, et al.
Pubblicazione: (2023)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
di: He, Jiahuan, et al.
Pubblicazione: (2023)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
di: Tauheed, et al.
Pubblicazione: (2026)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
di: Nguyen, Vinh
Pubblicazione: (2025)

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
di: Yildirim, E. Alper
Pubblicazione: (2025)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
di: Hu, Yaling, et al.
Pubblicazione: (2026)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
di: Nolasco, Eduardo, et al.
Pubblicazione: (2025)

On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem
di: Fallah, Samira, et al.
Pubblicazione: (2023)

Augmented Lagrangian methods for fully convex composite optimization
di: De Marchi, Alberto, et al.
Pubblicazione: (2025)

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
di: Ghosh, Suprova, et al.
Pubblicazione: (2025)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
di: Rando, Marco, et al.
Pubblicazione: (2026)

Exact augmented Lagrangian duality for mixed integer convex optimization
di: Bhardwaj, Avinash, et al.
Pubblicazione: (2022)

The SCIP Optimization Suite 9.0
di: Bolusani, Suresh, et al.
Pubblicazione: (2024)

The SCIP Optimization Suite 10.0
di: Hojny, Christopher, et al.
Pubblicazione: (2025)

Fixed Topology Minimum-Length Trees with Neighborhoods
di: Blanco, Víctor, et al.
Pubblicazione: (2024)

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces
di: Rahimi, Morteza, et al.
Pubblicazione: (2025)

Approximate stationarity in disjunctive optimization: concepts, qualification conditions, and application to MPCCs
di: Käming, Isabella, et al.
Pubblicazione: (2025)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
di: Lara, Felipe, et al.
Pubblicazione: (2025)

An uncertainty model for positive-valued parameters with application to robust optimization
di: Tanaka, Tatsuya, et al.
Pubblicazione: (2026)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
di: Xie, Pengcheng, et al.
Pubblicazione: (2023)