Foundations of Optimization

DOI10.1007/978-0-387-68407-9zbMath1220.90001OpenAlexW641467550MaRDI QIDQ5503213

Osman Güler

Publication date: 13 January 2009

Published in: Graduate Texts in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-68407-9

zbMATH Keywords

optimizationlinear programmingNewton's methodconvexityoptimality conditionsdualitynonlinear analysismathematical programmingsemi-infinite programmingconvex polyhedrasteepest-descent methodconjugate-gradient methodEkeland's epsilon-variational principle

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Programming in abstract spaces (90C48) Semi-infinite programming (90C34) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (52)

Hybrid genetic deflated Newton method for global optimisation ⋮ On the identification of the optimal partition for semidefinite optimization ⋮ On the rectilinear crossing number of complete uniform hypergraphs ⋮ Sparsity constrained optimization problems via disjunctive programming ⋮ Linearly convergent away-step conditional gradient for non-strongly convex functions ⋮ Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems ⋮ Safe sample screening rules for multicategory angle-based support vector machines ⋮ Using geometric arithmetic mean to solve non-linear fractional programming problems ⋮ \(k\)-sets and rectilinear crossings in complete uniform hypergraphs ⋮ Two new splitting algorithms for equilibrium problems ⋮ Deville and Särndal's calibration: revisiting a 25-years-old successful optimization problem ⋮ Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver ⋮ Robust and Pareto optimality of insurance contracts ⋮ A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms ⋮ Moment intermittency in the PAM with asymptotically singular noise ⋮ Generalized polarity and weakest constraint qualifications in multiobjective optimization ⋮ Counting paths, cycles, and blow‐ups in planar graphs ⋮ Spatial implementation ⋮ An invitation to optimality conditions through non-smooth analysis ⋮ Scaling up twin support vector regression with safe screening rule ⋮ On multiobjective bilevel optimization using tangential subdifferentials ⋮ Approximate Lagrangian duality and saddle point optimality in set optimization ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ Unnamed Item ⋮ Codomain rigidity of the Dirichlet to Neumann operator for the Riemannian wave equation ⋮ Barrier method in nonsmooth convex optimization without convex representation ⋮ Refining the partition for multifold conic optimization problems ⋮ Unnamed Item ⋮ Flexible linear mixed models with improper priors for longitudinal and survival data ⋮ Optimal design of uptime-guarantee contracts under IGFR valuations and convex costs ⋮ Spectral factorization using FFTs for large‐scale problems ⋮ Existence of solutions for generalized vector quasi-equilibrium problems in abstract convex spaces with applications ⋮ A spatial analogue of May's theorem ⋮ Discrete time optimal control with frequency constraints for non-smooth systems ⋮ Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver ⋮ A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation ⋮ A spatial analogue of May's theorem ⋮ A Data-Independent Distance to Infeasibility for Linear Conic Systems ⋮ Comments on: ``A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors ⋮ A hybrid acceleration strategy for nonparallel support vector machine ⋮ Support and separation properties of convex sets in finite dimension ⋮ The Discrete-Time Geometric Maximum Principle ⋮ Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration ⋮ A safe screening rule for accelerating weighted twin support vector machine ⋮ On the minimax theorem for the space of probability measures on metric spaces ⋮ Exact Duality in Semidefinite Programming Based on Elementary Reformulations ⋮ On cutting planes for cardinality-constrained linear programs ⋮ Generalized versions of reverse Young inequalities ⋮ Algorithms for Simple Bilevel Programming ⋮ The structure of variational preferences ⋮ Stability analysis of Crank-Nicolson and Euler schemes for time-dependent diffusion equations ⋮ Technical Note—Two-Stage Sample Robust Optimization

This page was built for publication: Foundations of Optimization