scientific article; zbMATH DE number 439380
From MaRDI portal
Publication:3141900
zbMATH Open0795.49001MaRDI QIDQ3141900FDOQ3141900
Authors: Jean-Baptiste Hiriart-Urruty, Claude Lemaréchal 
Publication date: 1 November 1993
Title of this publication is not available (Why is that?)
Recommendations
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonsmooth analysis (49J52) Convexity of real functions of several variables, generalizations (26B25) Convex functions and convex programs in convex geometry (52A41) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
Cited In (only showing first 100 items - show all)
- Title not available (Why is that?)
- Title not available (Why is that?)
- SUSPECT: MINLP special structure detector for Pyomo
- Nonconvex bundle method with application to a delamination problem
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
- Title not available (Why is that?)
- Composite proximal bundle method
- Split Bregman method for large scale fused Lasso
- The first-order necessary conditions for sparsity constrained optimization
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- On \(\epsilon\)-solutions for robust fractional optimization problems
- On local search in d.c. optimization problems
- A stabilized structured Dantzig-Wolfe decomposition method
- Nonsmooth optimization via quasi-Newton methods
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Sample average approximation of stochastic dominance constrained programs
- Convex optimization theory.
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Decomposition algorithm for large-scale two-stage unit-commitment
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- On global search in nonconvex optimal control problems
- Affine processes on symmetric cones
- On approximations with finite precision in bundle methods for nonsmooth optimization
- On numerical solving the spherical separability problem
- Quantifying repulsiveness of determinantal point processes
- The omnipresence of Lagrange
- Optimal learning with \textit{Q}-aggregation
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Affine processes on positive semidefinite matrices
- Modern methods for solving nonconvex optimal control problems
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- Duality-based algorithms for total-variation-regularized image restoration
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- On the Behrens-Fisher problem: a globally convergent algorithm and a finite-sample study of the Wald, LR and LM tests
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- A bundle-Newton method for nonsmooth unconstrained minimization
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- On solving large-scale finite minimax problems using exponential smoothing
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Local convergence analysis of the Gauss-Newton method under a majorant condition
- A bundle method for solving equilibrium problems
- Necessary and sufficient global optimality conditions for convex maximization revisited
- On duality gap with polynomial multipliers for polynomial optimization problems
- Local convergence analysis of inexact Gauss-Newton like methods under majorant condition
- Convexity with respect to a differential equation
- Motzkin decomposition of closed convex sets
- Feasible direction interior-point technique for nonlinear optimization
- Separation of sets and Wolfe duality
- Interpolation and approximation from convex sets
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
- Variational formulation and structural stability of monotone equations
- Numerical aspects of the sweeping process
- Cut-generating functions and \(S\)-free sets
- A descent proximal level bundle method for convex nondifferentiable optimization
- Using duality to solve generalized fractional programming problems
- Duality in D. C. programming: The case of several D. C. constraints
- Generalized Nash equilibrium problem, variational inequality and quasiconvexity
- New existence results for equilibrium problems
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
- Dual scaling of comparison and reference stimuli in multi-dimensional psychological space
- Nonsmooth optimization
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Fast linear iterations for distributed averaging
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- Excess payoff dynamics and other well-behaved evolutionary dynamics
- An easy path to convex analysis and applications
- Global optimality conditions for optimal control problems with functions of A.D. Alexandrov
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Linearized Bregman iterations for compressed sensing
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Unconstrained minimization approaches to nonlinear complementarity problems
- Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Factorization and cutting planes for completely positive matrices by copositive projection
- Lagrangian smoothing heuristics for Max-cut
- A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata
- An augmented Lagrangian approach for sparse principal component analysis
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- ε-Subdifferential and ε-monotonicity
- Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
- Introductory lectures on convex optimization. A basic course.
- Margins on short sales and equilibrium price indeterminacy
- Convex analysis of invariant sets for a class of nonlinear systems
- Team optimization problems with Lipschitz continuous strategies
- Nonconvex integration using \(\varepsilon\)-subdifferentials
- General solution procedures in elasto/viscoplasticity
- Using enclosing ellipsoids in multiaxial fatigue strength criteria
- Numerical identification of parameters for a strongly degenerate convection-diffusion problem modelling centrifugation of flocculated suspensions
- Extensions of Gauss quadrature via linear programming
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141900)
